#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>	// require sort next_permutation count __gcd reverse etc.
#include <cstdlib>	// require abs exit atof atoi 
#include <cstdio>		// require scanf printf
#include <functional>
#include <numeric>	// require accumulate
#include <cmath>		// require fabs
#include <climits>
#include <limits>
#include <cfloat>
#include <iomanip>	// require setw
#include <sstream>	// require stringstream 
#include <cstring>	// require memset
#include <cctype>		// require tolower, toupper
#include <fstream>	// require freopen
#include <ctime>		// require srand
#define rep(i,n) for(int i=0;i<(n);i++)
#define ALL(A) A.begin(), A.end()

/*
	No.16 累乗の加算

	累乗の計算

	蟻本：p125 参照

	因みに 1000003 は素数。
	これは Prime Numbers Generator and Checker
	
	http://www.numberempire.com/primenumbers.php

	で調べることができる。
*/

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

const ll MOD = (ll)1e6 + 3LL; 

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

int main()
{
	ios_base::sync_with_stdio(0);
	ll x, N; cin >> x >> N;
	vector<ll> a(N, 0LL );
	rep (i, N ) cin >> a[i];

	ll res = 0LL;
	rep (i, N ){
		res = (res + mod_pow(x, a[i], MOD ) ) % MOD;
	} // end rep

	cout << (int)res << endl;

	return 0;
}