#!/usr/bin/python
def mod_pow(a, n, m):
    res = 1
    while n > 0:
        if n & 1:
            res = (res * a) % m
        a = (a * a) % m
        n >>= 1
    return res

MOD = 1000003
x, _ = map(int, raw_input().split())
a = map(int, raw_input().split())
res = 0
for ele in a:
    res = (res + mod_pow(x, ele, MOD)) % MOD
print res