#include <iostream>
#include <iomanip>

#include <algorithm>
#include <math.h>

#include <string>
#include <list>
/////////
#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i,n) REP(i,0,n)
#define P(p) cout<<(p)<<endl;
/////////
typedef long long LL;
typedef long double LD;
/////////
using namespace::std;
/////////
const int mod = 1000003;//

int x,N;
LL xpow[27];

void ppp(){
	xpow[0] = x;
	for(int i=1;i<27;++i) {
		xpow[i] = (xpow[i-1] * xpow[i-1])%mod;
	}
}

int f(int a){
	if( a == 0){
		return 1;
	}
	LL ans = 1;
	int temp = a;
	int count = 0;
	while(temp != 0){
		if(temp%2 == 1){
			ans = (ans * xpow[count]) % mod;
		}

		temp /= 2;
		++count;
	}
	return (int)ans;
}
int main(void){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed;//
    //cout << setprecision(6);//
	
	
	cin>>x>>N;
	//x[1,100]整数
	//N[1,100]
	int a[100];
	rep(i,N){
		cin>>a[i];
		//a[0,10^8]
	}
	////
	ppp();

	int sum=0;
	rep(i,N){
		sum = (sum + f(a[i]) ) % mod;
	}

	P(sum);

	return 0;
}