#include <bits/stdc++.h>

using namespace std;
using ll = long long;

int main()
{
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    ll N, P;
    cin >> N >> P;

    vector<ll> all;

    for (int a = 1; a <= 9; a++)
    {
        for (int b = 0; b <= 9; b++)
        {
            for (int c = 0; c <= 9; c++)
            {
                ll number = 110000 * a + 1001 * b + 110 * c;
                all.push_back(number);
            }
        }
    }

    sort(all.begin(), all.end());

    vector<ll> s;
    for (int i = 0; i < all.size(); i++)
    {
        bool ok = true;
        for (int j = 0; j < i; j++)
        {
            ok &= (all[i] % all[j] != 0);
        }

        if (ok)
        {
            s.push_back(all[i]);
        }
    }

    unordered_set<ll> seen;

    ll ans = 0LL;

    for (int i = 0; i < s.size(); i++)
    {
        for (ll n = s[i]; n <= N; n += s[i])
        {
            if (seen.count(n)) continue;
            seen.insert(n);

            ans += n;
            ans %= P;
        }
    }

    ans = P - ans;
    ans %= P;

    cout << ans << endl;
}