#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <string.h>
#include <vector>
using namespace std;

#define ll long long
#define INF (1 << 30)
#define INFLL (1LL << 60)

#define FOR(i,a,b) for(ll i = (a);i<(b);i++)
#define REP(i,a) FOR(i,0,(a))
#define MP make_pair

#define MOD 1000003

ll rui(ll last, ll num){
	if(last == 0) return 1;
	if(last == 1) return num;

	ll ret = 0;

	if(last % 2 == 0){
		ret = rui(last / 2, num);
		ret = ret * ret;
	}else{
		ret = rui(last - 1, num) * num;
	}

	return ret % MOD;
}

int main() {
	ll x, n, a, ans = 0;
	cin >> x >> n;
	for(int i = 0;i < n;i++){
		cin >> a;
		ans += rui(a, x);
		// ans %= MOD;
	}
	cout << ans << endl;
	return 0;
}