#include<iostream>
#include<algorithm>
#include<cmath>
#include<cstdio>
using namespace std;
int n,k;
long long mod=10000000019ll, a[6001][6001];
int main()
{
    freopen ("grid.in", "r", stdin);
    freopen ("grid.out", "w" , stdout);
    scanf("%d%d",&n,&k);
    for (int i=1; i<=k; i++)
    {
        int x, y;
        scanf("%d%d",&x, &y);
        a[x][y]=-1ll;
    }
    a[1][0]=1ll;
    for (int i=1; i<=n; i++)
    {
        for (int j=1; j<=n; j++)
        {
            if (a[i][j]==0)
            {
                if (a[i-1][j]!=-1 && a[i][j-1]!=-1)
                    a[i][j]=(a[i-1][j]+a[i][j-1])%mod;
                    else
                if (a[i-1][j]==-1 && a[i][j-1]!=-1)
                    a[i][j]=a[i][j-1];
                    else
                if (a[i-1][j]!=-1 && a[i][j-1]==-1)
                    a[i][j]=a[i-1][j];
                    else
                        a[i][j]=0ll;
            }
        }
    }
    printf("%lld\n",a[n][n]);
    return 0;
}