#include <algorithm>
#include <cstdio>
#include <iostream>
#include <map>
#include <cmath>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <stdlib.h>
#include <stdio.h>
#include <bitset>
using namespace std;

#define PI         acos(-1.0)
#define FOR(I,A,B) for(int I = (A); I < (B); ++I)

typedef long long ll;

//高速に累乗を計算
long long fastpow(long long base, long long e){
    long long ans = 1;
    for(long long p = base; e; e >>= 1, p = (p * p) % 1000003){
        if(e & 1) ans = (ans * p) % 1000003;
    }
    return ans;
}

int main(){
    ll x, n;
    cin >> x >> n;
    ll ans = 0;
    FOR(i,0,n){
        ll a;
        cin >> a;
        ans += fastpow(x, a);
        ans %= 1000003;
    }
    cout << ans << endl;
}