#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<algorithm>
#define N 100005
#define int long long
#define ul unsigned long long
#define db double
#define fo(i,l,r) for(int i=l;i<=r;i++)
#define rf(i,r,l) for(int i=r;i>=l;i--)
using namespace std;
int n,m,k,l,a[N],ans;
void swap(int &x,int &y){int t=x;x=y;y=t;}
int max(int x,int y){return x>y?x:y;}
int min(int x,int y){return x<y?x:y;}
int read(){
	int sum=0;bool f=0;char c=getchar();
	for(;c<48||c>57;c=getchar())if(c==45)f=1;
	for(;c>=48&&c<=57;c=getchar())sum=sum*10+(c&15);
	return f?-sum:sum;
}
signed main(){
	freopen("number.in","r",stdin);freopen("number.out","w",stdout);
	n=read();m=read();k=read();l=read();
	fo(i,1,n)a[i]=read();
	if(k>=m)return !printf("0");
	fo(i,1,n)
	{
		int sum=0;
		fo(j,i,n)
		{
			if(j-i>=l)break; 
			sum=(sum*10+a[j])%m;
			if(sum==k)ans++;
		}
	}
	printf("%lld",ans);
	return 0;
}