#include "bits/stdc++.h" #include #define _CRT_SECURE_NO_WARNINGS #define REP(i, n) for(decltype(n) i = 0; i < (n); i++) #define REP2(i, x, n) for(decltype(x) i = (x); i < (n); i++) #define REP3(i, x, n) for(decltype(x) i = (x); i <= (n); i++) #define RREP(i, n) for (decltype(n) i = (n) - 1; i >= 0; i--) #define ALL(a) (a).begin(),(a).end() #define SORT(c) sort((c).begin(),(c).end()) #define DESCSORT(c) sort(c.begin(), c.end(), greater()) using namespace std; // N, E, S, W const int dx[4] = { 1, 0, -1, 0}; const int dy[4] = { 0, 1, 0, -1}; using LL = long long int; using LD = long double; const int INF = (1 << 30) - 1; const LL INF64 = ((LL)1 << 62) - 1; const double PI = 3.1415926535897932384626433832795; using pii = pair; using pll = pair; using pdd = pair; using vi = vector; using vvi = vector; using vvvi = vector; using vl = vector; using vvl = vector; using vvvl = vector; using vd = vector; using vs = vector; using vb = vector; //============================================== const LL MOD = 1000003; LL ans = 0; LL fonc(LL x, LL a) { LL r = 1; while (a > 0) { if (a & 1) r = (r * x) % MOD; x = (x * x) % MOD; a >>= 1; } return r; } int main() { ios::sync_with_stdio(false); cin.tie(0); LL x, n; cin >> x >> n; int a; REP(i, n) { cin >> a; ans += fonc(x, a); } cout << ans << "\n"; return 0; }