5355: The Maths Lecture
内存限制：256 MB
时间限制：2 S
题面：传统
评测方式：文本比较
上传者：
提交：1
通过：1
题目描述
D. The Maths Lecture
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output
Amr doesn't like Maths as he finds it really boring, so he usually sleeps in Maths lectures. But one day the teacher suspected that Amr is sleeping and asked him a question to make sure he wasn't.
First he gave Amr two positive integers n and k. Then he asked Amr, how many integer numbers x>0 exist such that:
Can you help Amr escape this embarrassing situation?
First he gave Amr two positive integers n and k. Then he asked Amr, how many integer numbers x>0 exist such that:
- Decimal representation of x (without leading zeroes) consists of exactly n digits;
-
There exists some integer y>0 such that:
-
;
- decimal representation of y is a suffix of decimal representation of x.
-
Can you help Amr escape this embarrassing situation?
Input
Input consists of three integers n,k,m (1≤n≤1000, 1≤k≤100, 1≤m≤109).
Output
Print the required number modulo m.
Examples
Input
1 2 1000
Output
4
Input
2 2 1000
Output
45
Input
5 3 1103
Output
590
Note
A suffix of a string S is a non-empty string that can be obtained by removing some number (possibly, zero) of first characters from S. 输入样例 复制
输出样例 复制