NOCHANGE  No Change
Though it might be hard to imagine, the inhabitants of a small country Additivia do not know of such thing as change, which probably has to do with them not knowing subtraction either. When they buy something, they always need to have the exact amount of addollars, their currency. The only other option, but not a really attractive one, is overpaying.
Professor Adem, one of the Additivian mathematicians came up with an algorithm for keeping a balanced portfolio. The idea is the following. Suppose you have more coins of value $v_1$ than coins of value $v_2$. In this case you should try to spend at least as many coins of value $v_1$ as those of value $v_2$ on any buy you make. Of course spending too many $v_1$ coins is not a good idea either, but to make the algorithm simpler professor Adem decided to ignore the problem. The algorithm became an instant hitand professor Adem is now designing a kind of "electronic portfolio" with builtin Adem's algorithm. All he needs now is a software for these machines, that will decide whether a given amount ofaddollars can be paid using a given set of coins according to the rules of Adem's algorithm. Needless to say, you are his chosen programmer for the task.
Problem
Write a program that reads the description of a set of coins and an amount of addollars to be paid, and determines whether you can pay that amount according to Professor Adem's rules.
Input
The input starts with the amount of addollars to be paid $x$, where $1 \le x \le 100,000$. The number of different coin values $k$ follows, where $1 \le k \le 5$. The values of the coins $v_1, \ldots, v_k$ follow, where $1 \le v_i \le 10,000$.
Notice that the order among coin values is significant: you need to spend at least as many coins of value $v_1$ as coins of value $v_2$, at least as many coins of value $v_2$ as those of value $v_3$, and so on. You may assume that you have a sufficiently large number of coins of each value.
Output
Your program should output for each test case either a single word "YES", if the given amount can be paid according to the rules, or a single word "NO" otherwise.
Example
Input: 13 3 9 2 1 Output: NO
hide comments
Abhishek Singh:
20160424 10:16:13
didn't understand the problem? can someone please simplify the problem stated? 

dsaini17:
20160327 22:14:10
First DP 

minhthai:
20160128 13:04:02
such a nice problem :) 

sarvesh_19:
20160125 19:13:13
nice recursion with memo > 0.00 

abhilash tayade:
20151119 14:31:55
my top down gives tle... :(...bottom up accepted 

Tej Bahadur Singh :
20150804 08:53:44
not getting to problem uderstand


bitwise:
20150527 11:42:59
my optimized (x*k*k) soln giving AC in (0.0) sec


Shubham Jadhav:
20150523 20:26:22
x*k solution passes, with 0.01 clocked.. 

Soumik Chatterjee:
20150322 07:22:24
Last edit: 20150327 17:12:20 

TUSHAR SINGHAL:
20150129 06:52:18
getting tle at test case 9 .. ???

Added by:  overwise 
Date:  20071004 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ACM ICPC  SWERC 2001 