Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
D. Number of Binominal Coefficients

time limit per test

4 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputFor a given prime integer *p* and integers α, *A* calculate the number of pairs of integers (*n*, *k*), such that 0 ≤ *k* ≤ *n* ≤ *A* and is divisible by *p*^{α}.

As the answer can be rather large, print the remainder of the answer moduly 10^{9} + 7.

Let us remind you that is the number of ways *k* objects can be chosen from the set of *n* objects.

Input

The first line contains two integers, *p* and α (1 ≤ *p*, α ≤ 10^{9}, *p* is prime).

The second line contains the decimal record of integer *A* (0 ≤ *A* < 10^{1000}) without leading zeroes.

Output

In the single line print the answer to the problem.

Examples

Input

2 2

7

Output

3

Input

3 1

9

Output

17

Input

3 3

9

Output

0

Input

2 4

5000

Output

8576851

Note

In the first sample three binominal coefficients divisible by 4 are , and .

Codeforces (c) Copyright 2010-2021 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: May/09/2021 13:53:42 (j2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|