#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using mint = atcoder::modint;
// using mint = modint1000000007;
// const int mod = 1000000007;
// using mint = modint998244353;
// const int mod = 998244353;
// const int INF = 1e9;
// const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i, l, r) for (int i = (l); i < (r); ++i)
#define rrep(i, n) for (int i = (n)-1; i >= 0; --i)
#define rrep2(i, l, r) for (int i = (r)-1; i >= (l); --i)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define P pair<int, int>
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(nullptr);
	int n, p; cin >> n >> p;
	mint::set_mod(p);
	vector<int>v;
	rep2(i, 1, 10)rep(j, 10)rep(k, 10) {
		int x = 0;
		x = x * 10 + i;
		x = x * 10 + i;
		x = x * 10 + j;
		x = x * 10 + k;
		x = x * 10 + k;
		x = x * 10 + j;
		for (int i = x; i <= n; i += x) {
			v.push_back(i);
		}
	}
	std::sort(v.begin(), v.end());
	v.erase(std::unique(v.begin(), v.end()), v.end());
	mint ans = 0;
	for (auto e : v)ans += -e;
	cout << ans.val() << endl;
	return 0;
}