101295: [AtCoder]ABC129 F - Takahashi's Basics in Education and Learning

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $600$ points

Problem Statement

There is an arithmetic progression with $L$ terms: $s_0, s_1, s_2, ... , s_{L-1}$.

The initial term is $A$, and the common difference is $B$. That is, $s_i = A + B \times i$ holds.

Consider the integer obtained by concatenating the terms written in base ten without leading zeros. For example, the sequence $3, 7, 11, 15, 19$ would be concatenated into $37111519$. What is the remainder when that integer is divided by $M$?

Constraints

  • All values in input are integers.
  • $1 \leq L, A, B < 10^{18}$
  • $2 \leq M \leq 10^9$
  • All terms in the arithmetic progression are less than $10^{18}$.

Input

Input is given from Standard Input in the following format:

$L$ $A$ $B$ $M$

Output

Print the remainder when the integer obtained by concatenating the terms is divided by $M$.


Sample Input 1

5 3 4 10007

Sample Output 1

5563

Our arithmetic progression is $3, 7, 11, 15, 19$, so the answer is $37111519$ mod $10007$, that is, $5563$.


Sample Input 2

4 8 1 1000000

Sample Output 2

891011

Sample Input 3

107 10000000000007 1000000000000007 998244353

Sample Output 3

39122908

Input

题意翻译

有一等差数列,首项为 $A$,公差为 $B$,长度为 $L$。 现在把这个数列中所有数拼起来(e.g. $3,7,11,15,19->37111519$)。 问拼起来的这个数 $\bmod M$ 的值。 $1\le L,A,B \le 10^{18},1\le M\le 10^9$

加入题单

上一题 下一题 算法标签: