// I SELL YOU...! 
#include<iostream>
#include<vector>
#include<algorithm>
#include<functional>
#include<queue>
#include<chrono>
#include<iomanip>
#include<map>
#include<set>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using TP = tuple<ll,ll,ll>;
void init_io(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << setprecision(18);
}
#define MOD 1000003
map<ll,ll> mp;
long long pmod(long long x, long long n) {
  if(mp.find(n)!=mp.end()){
    return mp[n];
  }
  if(n==0) return mp[n] = 1;
  if(n%2==0){
    ll v = pmod(x,n/2);
    return mp[n] = (v*v)%MOD;
  }
  return mp[n] = (x*pmod(x,n-1))%MOD;
}
signed main(){
  init_io();
  ll x,n,ans=0;
  cin >> x >> n;
  vector<ll> a(n);
  for(int i=0;i<n;i++){
    cin >> a[i];
    ans += pmod(x,a[i]);
    ans %= MOD;
  }
  cout << ans << endl;
}