#include<iostream>
#include<algorithm>
using namespace std;

#define ll long long
const int MAXN = 1e5 + 5;
const int MAXM = 1005;

int n, m, k, L;
int a[MAXN], s[MAXN], powe[MAXN];
ll f[MAXM], g[MAXM], ans;

int main(){
	freopen("number.in", "r", stdin);
	freopen("number.out", "w", stdout);
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m >> k >> L;
    powe[0] = 1 % m;
    for(int i = 1;i <= n;i ++){
        char ch; cin >> ch;
        a[i] = ch - '0';
        powe[i] = (powe[i - 1] * 10) % m;
        s[i] = (1LL * s[i - 1] * 10 + a[i]) % m;
    }
    for(int i = 1;i <= n;i ++){
        for(int v = 0;v < m;v ++) g[v] = 0;
        for(int v = 0;v < m;v ++){
            if(f[v]){
            	g[(v * 10 + a[i]) % m] += f[v];
			}
        }
        g[a[i] % m] ++;
        if(i > L){
            int out = (s[i] - 1LL * s[i - L - 1] * powe[L + 1] % m + m) % m;
            g[out] --;
        }
        ans += g[k];
        for(int v = 0;v < m;v ++) f[v] = g[v];
    }
    cout << ans << '\n';
    return 0;
}