#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define debug(x) cerr << #x << " = " << (x) << ' '
#define bug(x) cerr << (x) << ' '
#define endl cerr << '\n'
#define all(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()
#define lowbit(x) (x)&-(x)
#define pb emplace_back
#define F first
#define S second
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
//#define TEST
const int N = 505;
const ll LLINF = 2e18;
ll a[N][N], sum[N], col[N][N];
int main(void)
{ IO
ll n, i, m, L, R, ans = LLINF;
cin >> n >> m >> L >> R;
if (L > R) swap(L, R);
for (i=1; i <= n; ++i)
for (int j=1; j <= m; ++j)
cin >> a[i][j], col[i][j] = col[i-1][j] + a[i][j];
for (int lb=0; lb < n; ++lb)
{
for (int ub=lb+1; ub <= n; ++ub)
{
ll it = 0, it2 = 0;
for (i=1; i <= m; ++i)
{
sum[i] = sum[i-1] + col[ub][i]-col[lb][i];
while (it <= i && sum[i]-sum[it] >= L) ++it;
while (it2 <= i && sum[i]-sum[it2] > R) ++it2;
if (it != it2)
{
ans = R - L;
} else {
ll x = sum[i] - sum[it];
ans = min(ans, abs(L-x) + abs(R-x));
if (it != 0)
{
x = sum[i] - sum[it-1];
ans = min(ans, abs(L-x) + abs(R-x));
}
}
}
}
}
cout << ans << '\n';
return 0;
}
