#include<iostream>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<vector>
#include<map>
#include<unordered_map>
#include<queue>
#include<deque>
#define fi first
#define se second
#define pb push_back
#define ppb pop_back
#define int long long
using namespace std;

const int N=5010,mod=998244353;
int dp[N][N],l[N],p[N];
int a,n,m,n0,cnt;

signed main() {
        cin>>a>>n>>m>>n0;
        for (int i=1;i<=n0*a;++i) {
                cin>>p[i];
                if (i>1&&p[i]<p[i-1]) cnt++;
        }
        dp[n0][cnt]=1;
        int now=n0*a;
        for (int i=n0;i<n;++i) {
                for (int j=0;j<=i;++j) {
                        int up=now-1-j;
                        dp[i+1][j+1]+=dp[i][j]*(up+1);
                        dp[i+1][j]+=dp[i][j]*(j+1);
                }
                now+=a;
        }
        cout<<dp[n][m]<<endl;
        return 0;
}