#include <cstdio>
#include <algorithm>
#include <cstring>
#define Nmax 205
#define Kmax 105
#define mod 30103
using namespace std;
int n, i, j, k, a, b, r, cif,i2;
int d[2][Nmax][Kmax];
int sol, v[Nmax];
int first[10][Nmax];
char s[Nmax];
int main()
{
    freopen("diviz.in", "r", stdin);
    freopen("diviz.out", "w", stdout);
    scanf("%d %d %d\n", &k, &a, &b);
    gets(s + 1);
    n = strlen(s + 1);

    for (i = 1; i <= n; ++ i)
      v[i] = s[i] - '0';

    for (i = n; i >= 1; -- i)
    for (j = 0; j <= 9; ++ j)
    if (v[i] != j)
    first[j][i] = first[j][i + 1];
    else first[j][i] = i;

    for (j = 1; j <= 9; ++ j)
    if (first[j][1])
    {
        d[1][first[j][1]][j % k] = 1;
        if (a == 1 && j % k == 0)
          sol = (sol + d[1][first[j][1]][j % k]) % mod;
    }
    i2 = 1;
    for (i = 1; i < b; ++ i)
    {
        i2 = 1 - i2;
        for (j = 1; j <= n; ++ j)
         for (cif = 0; cif <= 9; ++ cif)
           if (first[cif][j + 1])
             for (r = 0; r < k; ++ r)
           {
               d[i2][first[cif][j + 1]][(r * 10 + cif) % k] =
               ( d[1 - i2][j][r] + d[i2][first[cif][j + 1]][(r * 10 + cif) % k]) % mod;

           }
        if (i + 1>= a)
        {
            for (j = 1; j <= n; ++ j)
            sol = (sol + d[i2][j][0]) % mod;
        }

        memset(d[1 - i2], 0, sizeof(d[1 - i2]));

    }
    printf("%d", sol);

    return 0;
}