package no3535_otogibanashi;
import java.util.*;
public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		long n = sc.nextLong();
		long MOD = sc.nextLong();
		long ans = 0;
		HashSet<Long> set = new HashSet<>();
		//10^5,10^4
		for(int i = 1;i <= 9;i++) {
			//10^3,10^0
			for(int j = 0;j <= 9;j++) {
				//10^2,10^1
				for(int k = 0;k <= 9;k++) {
					long v = i * 110000;
					v += j * 1001;
					v += k * 110;
					for(long p = v;p <= n;p += v) {
						if(!set.contains(p)) {
							ans += p;
						}set.add(p);
					}ans %= MOD;
					
				}
			}
		}//System.out.println(ans);
		System.out.println((MOD - ans) % MOD);
	}

}