#include <iostream>
#include <algorithm>
#include <cmath>
#include <vector>
#include <numeric>
#include <string>
using namespace std;
int mod = (int)(1e6 + 3);

int ceil(int a, int b){
    if (a % b){
        return a/b + 1;
    }else
        return a/b;
}

typedef unsigned long long ull;

ull pow(ull p, ull n) {
  ull w = 1;
  for (ull i = 1ULL << (sizeof(ull)*8-1); i != 0; i >>= 1) {
    if ((n & i) == 0) {
      w *= w;
    } else {
      w *= w * p;
    }
  }
  return w;
}

ull modpow(ull p, ull n, ull m) {
  ull w = 1;
  for (ull i = 1ULL << (sizeof(ull)*8-1); i != 0; i >>= 1) {
    if ((n & i) == 0) {
      w *= w;
    } else {
      w *= w * p;
    }
    w %= m;
  }
  return w;
}
int main(){
    int x,n;
    cin >> x >> n;
    vector<int> arr;
    while (n--){
        int t;
        cin >> t;
        arr.push_back(t);
    }
    int ans = 0;
    for(auto e:arr){
        ans += modpow(x,e,mod);
    }
    cout << ans << endl;
}