#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <set>
#include <list>
using namespace std;

long long mod = 1000003;
//二分累乗法
long long pow(long long x,long long n){
    long long c = 0;
    if (n == 0) {return 1;}
    if (n == 1){ return x;}
    //漸化式
    if(n%2 == 1){
        return x * pow(x,n - 1) % mod;
    }
    else{
        long long c = pow(x,n/2);
        return c * c % mod;
    }
}

int main(int argc, const char * argv[]) {
    long long x;
    cin >> x;
    long long N;
    cin >> N;
    long long n;
    long long result = 0;
    vector<long long>a;
    for (int i = 0; i < N; i++) {
        cin >> n;
        result += pow(x,n);
    }
    cout << result%mod;
    cout << "\n";
}