#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi  = vector<int>; using vb  = vector<bool>; using vd  = vector<double>; using vl  = vector<ll>;
using vvi = vector<vi>;  using vvb = vector<vb>;   using vvd = vector<vd>;     using vvl = vector<vl>;

#define REP(i,n) for(ll i=0; i<(n); ++i)
#define TEN(x) ((ll)1e##x)
#define MOD (TEN(6) + 3)

template<ll mod> struct GF{
	ll v;
	GF(ll v = 0) : v((v % mod + mod) % mod){}
	GF operator+(GF x){return v + x.v;}

	GF pow(ll n) {
		ll x = v, r = 1;
		for (; n > 0; n >>= 1) {
			if (n & 1) (r *= x) %= mod;
			(x *= x) %= mod;
		}
		return r;
	}
};


int main() {
	ll _x, n;
	cin >> _x >> n;

	GF<MOD> x(_x);
	GF<MOD> sum = 0;
	REP(i, n) {
		ll a; cin >> a;
		sum = sum + x.pow(a);
	}

	cout << sum.v << endl;

	return 0;
}