#include<bits/stdc++.h>
using namespace std;
int main()
{
	int n,m,squ[1005][1005]={0};
	long long map[1005][1005]={1};
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		int x,y;
		scanf("%d%d",&x,&y);
		squ[x][y]++;
	}
	for(int i=1;i<=n;i++){
		for(int k=1;k<=n;k++)
	    {
		    if(squ[i][k]!=0||(i==1&&k==1)) continue;
		    if(k==1&&squ[i][k]==0) {map[i][k]=map[i-1][k]%100003;continue;}
		    if(i==1&&squ[i][k]==0) {map[i][k]=map[i-1][k]%100003;continue;}
		    if(squ[i][k]==0) {map[i][k]=(map[i-1][k]+map[i][k-1])%100003;continue;}
	    }
	}
	cout<<map[n][n];
	return 0;
}