Chtholly's request code force-897B

If a number is palindrome and length of its decimal representation without leading zeros is even, we call it a zcy number. A number is palindrome means when written in decimal representation, it contains no leading zeros and reads the same forwards and backwards. For example 12321 and 1221 are palindromes and 123 and 12451 are not. Moreover, 1221 is zcy number and 12321 is not.

Given integers k and p, calculate the sum of the k smallest zcy numbers and output this sum modulo p.

Unfortunately, Willem isn't good at solving this kind of problems, so he asks you for help!

Input

The first line contains two integers k and p (1 ≤ k ≤ 10⁵, 1 ≤ p ≤ 10⁹).

Output

Output single integer — answer to the problem.

Examples

Input

2 100

Output

33

Input

5 30

Output

15

Note

In the first example, the smallest zcy number is 11, and the second smallest zcy number is 22.

In the second example, .

题解：怎么枚举偶数位的回文数？从小到大该怎么想？把一个数与它翻转后的数连接在一起，就构成了偶数位的回文数，比如12，翻转后21，连在一起1221。

// ConsoleApplication3.cpp: 定义控制台应用程序的入口点。
//

#include"stdafx.h"
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
typedef long long ll;

ll cal(int m) {
    ll ans = m, t = m;
    while (t) {
        ans = ans * 10 + t % 10;
        t = t / 10;
    }
    return ans;
}

int main()
{
    int k, p;
    cin >> k >> p;
    ll sum = 0;
    for (int i = 1; i <= k; i++) sum = (sum + cal(i)) % p;
    cout << sum << endl;
    return 0;
}