#include <cstdio>

 #include <cstring>

 #include <cstdlib>

 #include <climits>

 #include <vector>

 #include <iostream>

 using namespace std;

 const int N=;

 const int inf =0x3f3f3f3f;

 int n,m,r,c,p[N][N],v[N],f[N],res=inf,t[N],t1[N][N];

 int DP() {

     memset(t,,sizeof t);

     memset(t1,,sizeof t1);

     for (int i=; i<=m; i++)//预处理同一列相邻行之间的差值

         for (int j=; j<v[]; j++) t[i]+=abs(p[v[j]][i]-p[v[j+]][i]);

     for (int i=; i<m; i++)//处理每一列之间的差值

         for (int j=i+; j<=m; j++)

             for (int k=; k<=v[]; k++) t1[i][j]+=abs(p[v[k]][i]-p[v[k]][j]);

     for (int i=; i<=m; i++) f[i]=t[i];

     for (int i=; i<=c; i++)//DP主要部分

         for (int j=m; j>=i; j--) {

             f[j]=inf;

             for (int k=j-; k>=i-; k--) f[j]=min(f[j],f[k]+t1[k][j]);

             f[j]+=t[j];

         }

     int ans=inf;

     for (int i=c; i<=m; i++) ans=min(ans,f[i]);

     return ans;

 }

 void DFS(int i,int dep) {//枚举行数

     if (dep==r) {

         res=min(res,DP());

         return;

     }

     for (int j=i; j<=n-r+dep+; j++) {

         v[++v[]]=j;

         DFS(j+,dep+);

         v[v[]--]=;

     }

 }

 void work() {

     DFS(,);

     printf("%d\n",res);

 }

 int main() {

     memset(v,,sizeof(v));

     scanf("%d%d%d%d",&n,&m,&r,&c);

     for (int i=; i<=n; i++)

         for (int j=; j<=m; j++)

             scanf("%d",&p[i][j]);

     work();

     return ;

 }