#coding: utf-8
##yuki_16

def powmod(a,b,m):
 r=1
 while b>0:
  if b%2==1:
   r=(r*a)%m
  b/=2
  a=(a*a)%m
 return r

x,n=map(int,raw_input().split())
s=raw_input().split()
m=1000003
sum=0
for i in xrange(n):
 a=int(s[i])
 pm=powmod(x,a,m)%m
 sum=(sum+pm)%m

print sum