use std::collections::HashSet;

use proconio::input;

fn main() {
    input! {
        n: usize, p: usize,
    }

    let mut seen = HashSet::new();
    let mut ans = 0;
    for a in 0..10 {
        for b in 0..10 {
            for c in 1..10 {
                let k = 110000 * c + 110 * b + 1001 * a;
                for i in (k..=n).step_by(k) {
                    if seen.insert(i) {
                        ans = (ans + i) % p;
                    }
                }
            }
        }
    }
    ans = (p - ans) % p;

    println!("{ans}");
}