#include <bits/stdc++.h>
#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <string>
#include <sstream>
#include <cmath>
#include <stack>
#include <queue>
#include <cctype>
#include <stdio.h>
#include <map>
#include <string.h>
#include <utility>

typedef long long ll;
using namespace std;

typedef pair<int, int> P;

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(){

	int x=0,n=0;
	cin>>x>>n;

	ll ans=0;
	for(int i=0; i<n; i++){
		ll tmp;
		cin>>tmp;

		ans += mod_pow(x,tmp,1000003);
	}

	cout<<ans%1000003<<endl;



	return 0;
}