#include <iostream>
using namespace std;
typedef long long ll;
const ll mod = 1000003;

// from the Arihon
ll mod_pow(ll x, ll n, ll m){
	ll res = 1;
	while (n > 0){
	if (n & 1) res = res * x % mod;
		x = x * x % mod;
		n >>= 1;
	}
	return res;
}

int main()
{   int x, N, ans;
	cin >> x >> N;
	long long a[N];
	for (int i = 0; i < N; i++) {
		a[i] = 0;
	}
	for (int i = 0; i < N; i++) {
		cin >> a[i];
	}
	for (int i = 0; i < N; i++) {
		long long p = mod_pow(x,a[i],mod);
		ans += p;
		ans = ans%mod;
	}
    cout << ans << endl;
    return 0;
}