#include <iostream>

using namespace std;

long long f[1010][1010];
bool g[1010][1010];

int main(){
	int n, m;
	cin>>n>>m;
	while(m--){
		int x, y;
		cin>>x>>y;
		g[y][x] = 1;
	}
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= n; j++){
			if(g[i][j]) continue;
			else {
				if(i == 1 || j == 1){
					f[i][j] = 1;
				}
				else{
					f[i][j] = (f[i-1][j] % 100003) + (f[i][j-1] % 100003);
				}
			}
		}
	}
	cout<<(f[n][n] % 100003);
}