// tested by Hightail - https://github.com/dj3500/hightail
import std.stdio, std.string, std.conv, std.algorithm;
import std.range, std.array, std.math, std.typecons, std.container, core.bitop;

immutable mod = 1_000_003;
int x, n;

void main() {
    scan(x, n);
    auto a = readln.split.to!(int[]);

    long ans;

    a.each!(ai => (ans += modpow(x, ai, mod)) %= mod);

    writeln(ans);
}

long modpow(long x, long y, long mod) {
    return y > 0 ? modpow(x, y>>1, mod)^^2 % mod * x^^(y&1) % mod : 1L;
}


void scan(T...)(ref T args) {
    string[] line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}


void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}