#include <iostream>
#include <fstream>
#include <string>
#define mod 30103
using namespace std;

ifstream fin("diviz.in");
ofstream fout("diviz.out");
int dp[205][205][105], k, a, b, res, nr[205], first[10][205], n;

void citire() {
    fin >> k >> a >> b;
    string s;
    fin >> s;
    n = s.length();
    for(int i = 0; i < n; i++)
        nr[i+1] = s[i] - '0';
}

void solve() {
    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= i; j++)
            if(!first[nr[i]][j])
                first[nr[i]][j] = i;

    for(int i = 1; i < 10; i++)
        dp[1][first[i][1]][i%k] = 1;

    for(int j = 1; j <= b; j++) {
        for(int i = 1; i <= n; i++)
            for(int r = 0; r < k; r++) {
                if(dp[j%2][i][r] == 0) continue;
                while(dp[j%2][i][r] >= mod)
                    dp[j%2][i][r] -= mod;
                if(j >= a && !r) {
                    res += dp[j%2][i][r];
                    while(res >= mod)
                        res -= mod;
                }
                for(int cif = 0; cif < 10; cif++)
                    if(first[cif][i+1])
                        dp[1-j%2][first[cif][i+1]][(r*10+cif)%k] += dp[j%2][i][r];
            }
        for(int i = 1; i <= n; i++)
            for(int r = 0; r < k; r++)
                dp[j%2][i][r] = 0;

    }
    fout << res;
}

int main() {
    citire();
    solve();
}