Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Two Problems

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputA boy Valera registered on site Codeforces as Valera, and wrote his first Codeforces Round #300. He boasted to a friend Arkady about winning as much as *x* points for his first contest. But Arkady did not believe his friend's words and decided to check whether Valera could have shown such a result.

He knows that the contest number 300 was unusual because there were only two problems. The contest lasted for *t* minutes, the minutes are numbered starting from zero. The first problem had the initial cost of *a* points, and every minute its cost reduced by *d*_{a} points. The second problem had the initial cost of *b* points, and every minute this cost reduced by *d*_{b} points. Thus, as soon as the zero minute of the contest is over, the first problem will cost *a* - *d*_{a} points, and the second problem will cost *b* - *d*_{b} points. It is guaranteed that at any moment of the contest each problem has a non-negative cost.

Arkady asks you to find out whether Valera could have got exactly *x* points for this contest. You should assume that Valera could have solved any number of the offered problems. You should also assume that for each problem Valera made no more than one attempt, besides, he could have submitted both problems at the same minute of the contest, starting with minute 0 and ending with minute number *t* - 1. Please note that Valera can't submit a solution exactly *t* minutes after the start of the contest or later.

Input

The single line of the input contains six integers *x*, *t*, *a*, *b*, *d*_{a}, *d*_{b} (0 ≤ *x* ≤ 600; 1 ≤ *t*, *a*, *b*, *d*_{a}, *d*_{b} ≤ 300) — Valera's result, the contest's duration, the initial cost of the first problem, the initial cost of the second problem, the number of points that the first and the second problem lose per minute, correspondingly.

It is guaranteed that at each minute of the contest each problem has a non-negative cost, that is, *a* - *i*·*d*_{a} ≥ 0 and *b* - *i*·*d*_{b} ≥ 0 for all 0 ≤ *i* ≤ *t* - 1.

Output

If Valera could have earned exactly *x* points at a contest, print "YES", otherwise print "NO" (without the quotes).

Examples

Input

30 5 20 20 3 5

Output

YES

Input

10 4 100 5 5 1

Output

NO

Note

In the first sample Valera could have acted like this: he could have submitted the first problem at minute 0 and the second problem — at minute 2. Then the first problem brings him 20 points and the second problem brings him 10 points, that in total gives the required 30 points.

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/24/2019 23:46:57 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|