x,n=map(int,input().split())
a=list(map(int,input().split()))
def pow_k(x, n):
    """
    O(log n)
    """
    if n == 0:
        return 1

    K = 1
    while n > 1:
        if n % 2 != 0:
            K *= x
        x *= x
        n //= 2

    return K * x
dp=[0]*(max(a)+1)
ans=0
mod=1000003
for i in a:
    ans+=(pow_k(x,i)%mod)

print(ans%mod)