#include "bits/stdc++.h"
#include<unordered_map>
#include<unordered_set>
#pragma warning(disable:4996)
using namespace std;
using ld = long double;
template<class T>
using Table = vector<vector<T>>;
const ld eps=1e-9;


const int mod = 1000003;
struct Mod {
public:
	int num;
	Mod() : Mod(0) { ; }
	Mod(long long int n) : num((n % mod + mod) % mod) {
		static_assert(mod<INT_MAX / 2, "mod is too big, please make num 'long long int' from 'int'");
	}
	Mod(int n) : Mod(static_cast<long long int>(n)) { ; }
	operator int() { return num; }
};

Mod operator+(const Mod a, const Mod b) { return Mod((a.num + b.num) % mod); }
Mod operator+(const long long int a, const Mod b) { return Mod(a) + b; }
Mod operator+(const Mod a, const long long int  b) { return b + a; }
Mod operator++(Mod &a) { return a + Mod(1); }
Mod operator-(const Mod a, const Mod b) { return Mod((mod + a.num - b.num) % mod); }
Mod operator-(const long long int a, const Mod b) { return Mod(a) - b; }
Mod operator--(Mod &a) { return a - Mod(1); }
Mod operator*(const Mod a, const Mod b) { return Mod(((long long)a.num * b.num) % mod); }
Mod operator*(const long long int a, const Mod b) { return Mod(a)*b; }
Mod operator*(const Mod a, const long long int b) { return Mod(b)*a; }
Mod operator*(const Mod a, const int b) { return Mod(b)*a; }
Mod operator+=(Mod &a, const Mod b) { return a = a + b; }
Mod operator+=(long long int &a, const Mod b) { return a = a + b; }
Mod operator-=(Mod &a, const Mod b) { return a = a - b; }
Mod operator-=(long long int &a, const Mod b) { return a = a - b; }
Mod operator*=(Mod &a, const Mod b) { return a = a * b; }
Mod operator*=(long long int &a, const Mod b) { return a = a * b; }
Mod operator*=(Mod& a, const long long int &b) { return a = a * b; }
Mod operator^(const Mod a, const int n) {
	if (n == 0) return Mod(1);
	Mod res = (a * a) ^ (n / 2);
	if (n % 2) res = res * a;
	return res;
}
Mod mod_pow(const Mod a, const int n) {
	if (n == 0) return Mod(1);
	Mod res = mod_pow((a * a), (n / 2));
	if (n % 2) res = res * a;
	return res;
}
Mod inv(const Mod a) { return a ^ (mod - 2); }
Mod operator/(const Mod a, const Mod b) {
	assert(b.num != 0);
	return a * inv(b);
}
Mod operator/(const long long int a, const Mod b) {
	assert(b.num != 0);
	return Mod(a) * inv(b);
}
Mod operator/=(Mod &a, const Mod b) {
	assert(b.num != 0);
	return a = a * inv(b);
}

#define MAX_MOD_N 1024000

Mod fact[MAX_MOD_N], factinv[MAX_MOD_N];
void init() {
	fact[0] = Mod(1); factinv[0] = 1;
	for (int i = 0; i < MAX_MOD_N - 1; ++i) {
		fact[i + 1] = fact[i] * Mod(i + 1);
		factinv[i + 1] = factinv[i] / Mod(i + 1);
	}
}
Mod comb(const int a, const int b) {
	return fact[a] * factinv[b] * factinv[a - b];
}

struct line {
	int id;
	int a;
	int b;
};

void dfs(const int now,int&a,const vector<line>&ps,vector<vector<int>>&edges) {
	int nowl = ps[now].a;
	int nowr = ps[now].b;
	a++;
	while (a != ps.size()) {
		const int nextl = ps[a].a;
		const int nextr = ps[a].b;
		if (nowl <= nextl&&nextr <= nowr) {
			edges[now].push_back(a);
			dfs(a, a, ps, edges);
		}
		else {
			return;
		}
	}
}
pair<Mod, Mod>getans(const int now, const vector<line>&ps, const vector<vector<int>>&edges) {
	
		pair<Mod, Mod>ans(1, 1);
		for (auto e : edges[now]) {
			const auto p(getans(e, ps, edges));
			ans.first *=p.first;
			ans.second *= p.second;
		}
		if (!now)return ans;
		if (ps[now].a % 2)ans.first +=ans.second;
		else ans.second += ans.first;
		return ans;
	
}
int main() {
	while (1) {
		int N, M; cin >> N >> M;
		if (!N)break;
		vector<line>ps;
		int offset=-1;
		int mindis = N;
		for (int i = 0; i < M; ++i) {
			int a, b; cin >> a >> b; a--; b--;
			if (a == b)continue;
			if (a > b)swap(a, b);
			assert(a <= b);
			if (b - a == 1 || (N - (b - a) == 1)||(a-b)%2==0)continue;
			ps.push_back(line{ i,a,b });
		}
		if (N % 2) {
			cout << 0 << endl;
			continue;
		}
		ps.push_back(line{ -1,0,N });
		
		sort(ps.begin(), ps.end(), [](const line&l, const line&r) {
			return l.a == r.a ? l.b > r.b : l.a < r.a;
		});
		
		vector<vector<int>>edges(ps.size());
		int a (0);
		dfs(0, a, ps, edges);
		auto ans = getans(0, ps,edges);
		cout << ans.first + ans.second << endl;
	}
	return 0;
}

Measured memory_bytes: 14340