Numbers

Solving a computer science problem, Vovchyk once again made a mistake: he printed out the numbers without separating them by spaces. When he saw the result, Vovchyk was first upset, then wondered: how many different sequences of non-negative integers exist such that if you write them together (without spaces) you get exactly the same sequence of digits that he has? He also recalled that his program could output only numbers not exceeding $c$ and with no leading zeros.

To answer this question, Vovchyk decided to write a program to find the number of such different sequences of non-negative integers, each not exceeding $c$, whose concatenation yields exactly the given sequence of $n$ digits. Since this number can be very large, you only need to output its last $k$ digits.