/* -*- coding: utf-8 -*-
 *
 * 3535.cc:  No.3535 $E\times - Otogibanashi$ - yukicoder
 */

#include<cstdio>
#include<set>
#include<algorithm>

using namespace std;

/* constant */

/* typedef */

using ll = long long;
using si = set<int>;

/* global variables */

/* subroutines */

/* main */

int main() {
  int n, p;
  scanf("%d%d", &n, &p);

  int sum = 0;
  si eos;

  for (int d0 = 1; d0 <= 9; d0++)
    for (int d1 = 0; d1 <= 9; d1++)
      for (int d2 = 0; d2 <= 9; d2++) {
	int k = d0 * 110000 + d1 * 1001 + d2 * 110;
	if (eos.count(k)) continue;
	//printf(" %d\n", k);
	
	int e = n / k;
	if (e <= 0) break;
	
	for (int i = 1; i <= e; i++) {
	  int ek = i * k;
	  if (! eos.count(ek)) {
	    sum = (sum + ek) % p;
	    eos.insert(ek);
	  }
	}
      }
  //printf(" sum=%d\n", sum);

  int ans = (p - sum) % p;
  printf("%d\n", ans);

  return 0;
}