#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

const int N = 10;

int alpha, n, m, n0;
int subperm[N], oriperm[N];

bool is_order_perm()
{
	int occurs[N + 1]{};
	for (int i = 0; i < n * alpha; ++i)
		++occurs[oriperm[i]];
	for (int i = 1; i <= n; ++i)
		if (occurs[i] != alpha)
			return false;
	for (int i = 0; i < n * alpha; ++i)
		for (int j = i + 1; j < n * alpha; ++j)
		{
			if (oriperm[i] != oriperm[j])
				continue;
			for (int k = i + 1; k < j; ++k)
				if (oriperm[k] < oriperm[i])
					return false;
		}
	return true;
}

bool is_subseq()
{
	int ptr = 0;
	for (int i = 0; i < n * alpha; ++i)
		if (ptr < n0 * alpha && oriperm[i] == subperm[ptr])
			++ptr;
	return ptr == n0 * alpha;
}

bool check_indices()
{
	int greater_cnt = 0;
	for (int i = 0; i < n * alpha - 1; ++i)
		if (oriperm[i] > oriperm[i + 1])
			++greater_cnt;
	return greater_cnt == m;
}

int factorial(int n)
{
	int result = 1;
	for (int i = 1; i <= n; ++i)
		result *= i;
	return result;
}

int powi(int base, int exponent)
{
	int result = 1;
	for (int i = 0; i < exponent; ++i)
		result *= base;
	return result;
}

int main()
{
	int assist[N]{};
	int result = 0;
	cin >> alpha >> n >> m >> n0;
	for (int i = 0; i < n0 * alpha; ++i)
		cin >> subperm[i];
	for (int i = 0; i < n * alpha; ++i)
		assist[i] = i;
	do
	{
		for (int i = 0; i < n * alpha; ++i)
			oriperm[assist[i]] = i / alpha + 1;
		if (is_order_perm() && is_subseq() && check_indices())
			++result;
	} while (next_permutation(assist, assist + n * alpha));
	result /= powi(factorial(alpha), n);
	cout << result << '\n';
	return 0;
}