#![allow(unused_imports)]
#![allow(non_snake_case)]
use std::collections::HashMap;

#[allow(unused_macros)]
macro_rules! read {
    ([$t:ty] ; $n:expr) =>
        ((0..$n).map(|_| read!([$t])).collect::<Vec<_>>());
    ($($t:ty),+ ; $n:expr) =>
        ((0..$n).map(|_| read!($($t),+)).collect::<Vec<_>>());
    ([$t:ty]) =>
        (rl().split_whitespace().map(|w| w.parse().unwrap()).collect::<Vec<$t>>());
    ($t:ty) =>
        (rl().parse::<$t>().unwrap());
    ($($t:ty),*) => {{
        let buf = rl();
        let mut w = buf.split_whitespace();
        ($(w.next().unwrap().parse::<$t>().unwrap()),*)
    }};
}

#[allow(dead_code)]
fn rl() -> String {
    let mut buf = String::new();
    std::io::stdin().read_line(&mut buf).unwrap();
    buf.trim_end().to_owned()
}

trait IteratorExt: Iterator + Sized {
    fn vec(self) -> Vec<Self::Item> {
        self.collect()
    }
}
impl<T: Iterator> IteratorExt for T {}

const LAW: u64 = 1_000_003;

fn main() {
    let (x, _n) = read!(u64, usize);
    let a = read!([u64]);

    let ans = a
        .iter()
        .map(|&e|  my_pow(x, e) % LAW)
        .fold(0, |acc, e| (acc + e) % LAW);

    println!("{}", ans);
}

// (x^n) % LAW
fn my_pow(x: u64, n: u64) -> u64 {
    static mut MAP: Option<HashMap<u64, u64>> = None;
    unsafe {
        if let None = MAP {
            MAP = Some(HashMap::new());
            let m = MAP.as_mut().unwrap();
            m.insert(0, 1);
            m.insert(1, x);
        }

        let m = MAP.as_mut().unwrap();
        if let None = m.get(&n) {
            if n % 2 == 1 {
                let m = MAP.as_mut().unwrap();
                m.insert(n, (x * my_pow(x, n/2).pow(2)) % LAW);
            }
            else {
                let m = MAP.as_mut().unwrap();
                m.insert(n, (my_pow(x, n/2).pow(2)) % LAW);
            }        
        }

        *m.get(&n).unwrap()
    }
}