# Chtholly's request

## 题目描述

— 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 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!

## 输入输出格式

### 输入格式

The first line contains two integers \$ k \$ and \$ p \$ \$ (1<=k<=10^{5},1<=p<=10^{9}) \$ .

### 输出格式

Output single integer — answer to the problem.

## 输入输出样例

### 输入样例 #1

``````2 100
``````

### 输出样例 #1

``````33
``````

### 输入样例 #2

``````5 30
``````

### 输出样例 #2

``````15
``````

## 说明

In the first example, the smallest zcy number is \$ 11 \$ , and the second smallest zcy number is \$ 22 \$ . In the second example, ![](https://cdn.luogu.org/upload/vjudge_pic/CF897B/8301f23cf6a6ac38a43acd044c106b422734f787.png).