#include <iostream>

using namespace std;

const long long MOD = 1000003;

long long x, N, a;

long long pow(long long x, long long n, long long mod) {
	long long res = 1;
	while (n > 0) {
		if (n & 1) {
			res = (res * x) % mod;
		}
		n >>= 1;
		x = (x * x) % mod;
	}
	return res;
}

int main() {
	cin >> x >> N;
	long long res = 0;
	for (int i = 0; i < N; i++) {
		cin >> a;
		res = (res + pow(x, a, MOD)) % MOD;
	}
	cout << res << endl;
	return 0;
}