#include <iostream>

using namespace std;

#define REP(i,fast,last) for(int i=fast;i<last;i++)

const int devider = 1000003;
int x, n;

int pow(long long x, long long a){
  int res = 1;
  if (a > 0) {
    res = pow(x*x % devider, a/2);
    if (a%2 == 1) res = res*x % devider;
  }
  return res % devider;
}

int main(){
  cin >> x >> n;
  x %= devider;

  long long sum = 0;
  int val;
  REP(i,0,n){
    cin >> val;
    //1000003は素数なのでフェルマーの小定理を利用する
    sum += pow(x, val);
  }

  cout<<sum % devider<<endl;
}