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
breaking_code:
20141229 04:30:09
easy one


sidharth:
20140917 19:53:08
getting WA for 10th case.Algo seems fine though. 

Vivek Thakur:
20140727 20:56:04
pls provide more test cases..!! 

nitesh kumar:
20140625 08:21:18
classical problem 

Mitch Schwartz:
20140327 13:13:30
Images fixed by changing spoj.pl > spoj.com. (Also copied alt text for images into title attribute so that hovering mouse over the image shows the LaTeX.) Last edit: 20140327 13:59:19 

Charu:
20130622 08:22:37
Please provide more test cases 

Adel Ali:
20130309 05:42:44
n*(k^2) passes in 0.05..


Hamed Arafa:
20130302 23:09:53
I submitted O(k*(n^2)) solution and Accepted ! 

Tigran:
20120925 18:25:27
I found solution which runs log(n)+2^k,but it's harder to implement than simple n*k

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 