#include // ver2.6.1 //#include // FFT用 //#include //#include //using boost::math::tools::brent_find_minima;//fmin(f,L,R,100)で最小値をmp(x,min)で取得 //using boost::multiprecision::cpp_int;//cpp_int (任意の長さのint) #define fmin brent_find_minima #define int long long #define endl "\n" #define ALL(v) (v).begin(),(v).end() #define Vi vector #define VVi vector #define VVVi vector #define Vm vector #define Vs vector #define Vd vector #define Pii pair #define Pdd pair #define VPii vector #define Tiii tuple #define VTiii vector #define PQi priority_queue #define PQir priority_queue,greater> #define pb push_back #define mp make_pair #define mt make_tuple #define itos to_string #define stoi stoll #define FI first #define SE second #define cYES cout<<"YES"<()) #define rep(i,a,b) for(int i=a;i=b;i--) #define dem(a,b) ((a+b-1)/(b)) #define Vin(a) rep(iI,0,a.size())cin>>a[iI] #define INF 3000000000000000000 // 3.0*10^18(MAXの1/3くらい) #define MAX LLONG_MAX #define PI 3.141592653589793238462 //#define MOD 1000000007 // 10^9 + 7 //int MOD = 998244353; // 変更したいときはこちら int MOD = 1000003; const double EPS = 1e-10; using namespace std; struct mint{int x;mint(int x=0):x((x%MOD+MOD)%MOD){} mint operator-()const{return mint(-x);} mint& operator+=(const mint a){if((x+=a.x)>=MOD)x-=MOD;return*this;} mint& operator-=(const mint a){if((x+=MOD-a.x)>=MOD)x-=MOD;return*this;} mint& operator*=(const mint a){(x*=a.x)%=MOD;return*this;} mint operator+(const mint a)const{return mint(*this)+=a;} mint operator-(const mint a)const{return mint(*this)-=a;} mint operator*(const mint a)const{return mint(*this)*=a;} mint pow(int t)const{if(!t)return 1;mint a=pow(t>>1);a*=a;if(t&1)a*=*this;return a;} mint inv()const{return pow(MOD-2);} mint& operator/=(const mint a){return*this*=a.inv();} mint operator/(const mint a)const{return mint(*this)/=a;}}; istream& operator>>(istream& is, const mint& a) {return is >> a.x;} ostream& operator<<(ostream& os, const mint& a) {return os << a.x;} /* デバッグ用 */ void Vout(auto a){if(a.size()==0) cout<<"."<0)cout<0)cerr<n)return 0;if((n-r)n-r;--i){a=a*i;}for(int i=1;i> k >> n; Vi a(n); Vin(a); mint ans = 0; rep(i,0,n){ ans += mypow(k,a[i],MOD); } cout << ans << endl; return 0; }