#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <iterator>

//#define pb push_back
#define puts(x) cout << #x << " : " << x << endl;
//#pragma GCC diagnostic ignored "-Wconversion"
//#define REP(i,n) for (int i=0;i<(n);i++)
//#define REPE(i,n) for (int i=0;i<=(n);i++)
//#define init(a,b) memset((a), (b), (sizeof(a)));
//#define PI 3.14159265
//#define EPS (1e-10)
//#define EQ(a,b) (abs((a)-(b)) < EPS)

using namespace std;

typedef long long ll;
//#define int long long

int dxy[] = {0, 1, 0, -1, 0};

typedef pair<int, int> P;

ll mod = 1000 * 1000 + 3;

inline ll pow_mod(ll a, ll k, ll m) {
    ll r = 1;
    for (; k > 0; k >>= 1) {
        if (k & 1) (r *= a) %= m;
        (a *= a) %= m;
    }
    return r;
}

signed main() {
    ll x,n;
    cin>>x>>n;
    ll res = 0;
    while(n--){
        ll a;cin>>a;
        res += pow_mod(x, a, mod);
        res %= mod;
    }
    cout<<(res%mod)<<endl;

    return 0;
}