CF897B——Chtholly's request（关于回文数）

传送门：

http://codeforces.com/contest/897/problem/B

B. Chtholly's request

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

— Thanks a lot for today.

— I experienced so many great things.

— You gave me memories like dreams... But I have to leave now...

— One last request, can you...

— Help me solve a Codeforces problem?

— ......

— What?

Chtholly has been thinking about a problem for days:

If a number is palindrome and length of its decimal representation without leading zeros is even, we call it a zcy number. A number ispalindrome 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 ≤ 105, 1 ≤ p ≤ 109).

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, .

题意：简单说就是把前k个回文数加起来，然后总和对m取余

思路：开始自己的想法就错了，然后想到了各种问题，比如公式有问题，精度损失问题。。。最后看了各位大神的代码，着实佩服自己低到死的智商。。。

最后总的来说有两种方法：首先是把每个回文数加起来，然后求和就行了，下面的代码就是这种思路的实现。另外一种就是把每个数翻转一下如果和原数相同就是回文数，总的来说没有直接求回文数容易代码实现。但这个很直接的想法当时居然没有想到，这就确实很智障了。。。可能是最近做题不多，手生了（为自己很弱的思维性找个理由吧）

代码：

#include <bits/stdc++.h>
using namespace std;
typedef  long long ll;
int main(){
    ll k,m;
    while(cin>>k>>m){
        ll ans=0;
        for(ll i=1; i<=k; i++){
            ll x,y;
            x = i;
            y = i;
            while(y){
                x = x*10+y%10;
                y /= 10;
            }
            ans = (ans + x) % m;
        }
        cout<<ans;
    }
    return 0;
}

偶然看到网上大牛的perl代码：

<> =~ / /;

( $sum += $_ . reverse ) %= $' for 1 .. $`;

print 0 + $sum