#include<bits/stdc++.h>
#define MOD 998244353
#define x(p) p.second.first
#define y(p) p.second.second
#define sqeud(a) (x(a)*x(a)+y(a)*y(a))

using namespace std;

typedef long long ll;
typedef pair<ll, pair<int, int>> p3;

ll modpow(ll a, ll n) {
    if(n == 0 or a == 1) return 1;
    else if(n == 1) return a;

    if(n&1) return (a * modpow(a, n-1)) % MOD;

    ll temp = modpow(a, n / 2);
    return (temp*temp) % MOD;
}

ll modinv(ll a) {
    return modpow(a, MOD-2);
}



int main() {
    ios::sync_with_stdio(false);


    #ifdef DBG
    freopen("in", "r", stdin);
    #endif

    int n, m, r, c;
    cin>>n>>m;

    vector<p3> arr(n*m);

    for(int i = 0; i < n; i++) {
        for(int j = 0; j < m; j++) {
            int ind = i*m + j;
            cin>>arr[ind].first;
            arr[ind].second = {i + 1, j + 1};
        }
    }
    cin>>r>>c;

    sort(arr.begin(), arr.end());

    vector<ll> sqsum(n*m, 0);
    vector<ll> xsum(n*m, 0);
    vector<ll> ysum(n*m, 0);
    vector<ll> vsum(n*m, 0);
    // int i;

    ll v;

    for(int i = 0; i < n*m; i++) {
        if(i == 0) {
            sqsum[i] = sqeud(arr[i]);
            xsum[i] = x(arr[i]);
            ysum[i] = y(arr[i]);
        } else {
            sqsum[i] = (sqsum[i-1] + sqeud(arr[i]))%MOD;
            xsum[i] = xsum[i-1] + x(arr[i]);
            ysum[i] = ysum[i-1] + y(arr[i]);
        }

        if(x(arr[i]) == r and y(arr[i]) == c) {
            v = arr[i].first;
        }
    }

    ll ans = 0ll;

    for(int i = n*m - 1; i > 0; i--) {
        if(arr[i].first > v) continue;
        else if(arr[i].first == v and (x(arr[i]) != r or y(arr[i]) != c)) continue;
        
        p3 value = {arr[i].first, {-1, -1}};
        int ind = lower_bound(arr.begin(), arr.end(), value) - arr.begin();
        if(ind == 0) {
            break;
        }
        ll count = ind;
        ind--;
        ll count_inv = modinv(count);
        ll val = (count*sqeud(arr[i]))%MOD;

        val = (val + sqsum[ind])%MOD;
        val -= (2*x(arr[i])*xsum[ind]);
        val -= (2*y(arr[i])*ysum[ind]);
        while(val < 0) {
            val += MOD;
        }

        val = (val * count_inv) % MOD;
        ans = (ans + val) % MOD;
    }
    cout<<ans;
    return 0;
}