#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl "\n"
#define PII pair<int,int>
const int N=1e5+10;
int arr[N];
void solve()
{
	int r,n,m,n0;
	cin>>r>>n>>m>>n0;
	int c=0;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=r;j++)
		{
			arr[++c]=i;
		}
	}
	sort(arr+1,arr+1+n*r);
	deque<int>aas;
	for(int i=1;i<=r*n0;i++)
	{
		int x;
		cin>>x;
		aas.push_back(x);
	}
	int sum=0;
	do
	{
		int flag=0,fg=0,cnt=0;
		for(int i=1;i<=r*n;i++)
		{
			if(i!=r*n&&arr[i]>arr[i+1])cnt++;
			if((fg!=(int)aas.size())&&arr[i]==aas[fg])fg++;
			unordered_map<int,int>book;
			for(int j=1;j<i;j++)
			{
				book[arr[j]]++;
			}
			for(auto p:book)
			{
				if(p.second!=r&&p.first>arr[i])
				{
					flag=1;
					break;
				}
			}
			if(flag==1)break;
		}
		if(fg-(int)aas.size())flag=1;
		if(flag==0)
		{
			if(cnt==m)sum++;
		}
	}while(next_permutation(arr+1,arr+1+n*r));
	cout<<sum<<endl;
} 
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T=1;
//	cin>>T;
	while(T--)solve();
	return 0;
}