#include "bits/stdc++.h"
using namespace std;

typedef long long ll;
ll p = (ll)(1e6+3);

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

int main() {
	ll x, N;
	cin >> x >> N;
	vector<ll> a(N);
	for(int i=0; i<N; i++) cin >> a[i];

	ll ans=0;
	for (int i = 0; i < N; i++) {
		ans += mod_pow(x,a[i],p);
		ans %= p;
	}

	cout << ans << endl;

}