Dragons（贪心）

Kirito is stuck on a level of the MMORPG he is playing now. To move on in the game, he's got to defeat all n dragons that live on this level. Kirito and the dragons have strength, which is represented by an integer. In the duel between two opponents the duel's outcome is determined by their strength. Initially, Kirito's strength equals s.

If Kirito starts duelling with the i-th (1 ≤ i ≤ n) dragon and Kirito's strength is not greater than the dragon's strength xi, then Kirito loses the duel and dies. But if Kirito's strength is greater than the dragon's strength, then he defeats the dragon and gets a bonus strength increase by yi.

Kirito can fight the dragons in any order. Determine whether he can move on to the next level of the game, that is, defeat all dragons without a single loss.

Input

The first line contains two space-separated integers s and n (1 ≤ s ≤ 104, 1 ≤ n ≤ 103). Then n lines follow: the i-th line contains space-separated integers xi and yi (1 ≤ xi ≤ 104, 0 ≤ yi ≤ 104) — the i-th dragon's strength and the bonus for defeating it.

Output

On a single line print "YES" (without the quotes), if Kirito can move on to the next level and print "NO" (without the quotes), if he can't.

Examples

Input

2 2
1 99
100 0

Output

YES

Input

10 1
100 100

Output

NO

Note

In the first sample Kirito's strength initially equals 2. As the first dragon's strength is less than 2, Kirito can fight it and defeat it. After that he gets the bonus and his strength increases to 2 + 99 = 101. Now he can defeat the second dragon and move on to the next level.

In the second sample Kirito's strength is too small to defeat the only dragon and win.

/*这是一道很简单的贪心题目，但是我也提交了很多次才过，第一次错误是因为没有注意题目中提到的可以按任意顺序挑战龙，但也因为这次错误将我的思维带到了别的地方，虽然我改后代码提交通过但我一度觉得数据存在水分，因为我会想这个挑战成果是会有经验奖励的，有没有一种可能就是虽然想挑战这个龙需要的经验很高，并不是所需经验最低的，但是挑战成公会获得无比巨大的经验奖励足以战胜后面所有的龙。很显然这是一个错误思想，因为这个挑战这个龙并不需要损耗什么，或者有什么时间要求，所以只要按从难度小到难度大的顺序一步步挑战就可以，并不也存在刚刚说的问题。所以就是很简单的一道题目，只要设置一个结构体存储需要挑战所需的力量还有挑战成果所获得的奖励，再将挑战难度从小到大排序遍历一遍即可获得答案。*/

#include <iostream>
#include <algorithm>
using namespace std;
struct dragon{
    int strength;
    int gift;
}a[1010];
bool cmp(dragon x,dragon y)
{
    return x.strength<y.strength;
}
int main()
{
    int s,n;
    cin>>s>>n;
    for(int i=1;i<=n;i++)
        cin>>a[i].strength>>a[i].gift;
    sort(a+1,a+n+1,cmp);
    int i;
    for( i=1;i<=n;i++)
    {
        if(s>a[i].strength)
            s+=a[i].gift;
        else
            break;
    }
    if(i==n+1)
        cout<<"YES"<<endl;
    else
        cout<<"NO"<<endl;
    return 0;
}