#include <bits/stdc++.h>
#define MOD 998244353
#define int long long
#define ull unsigned long long
#define endl '\n'
#define fi first 
#define se second 
#define mp make_pair 
#define pb push_back 
#define eb emplace_back 
#define ceil(x,y) (x+y-1)/y
#define deb(x) { cerr << #x << '=' << x << '\n'; }
#define INF 0x3f3f3f3f 
using namespace std;
int cnt = 0;
vector<int> graphrow[100], graphcol[100];
bool used[100];
void dfs(int v, int n);
int fact(int n);

void solve(){
    //code goes here
    int n,x;
    cin >> n >> x;
    vector<int> a[n];
    for (int i = 0; i<n; ++i){
        a[i].resize(n);
        for (int j = 0; j<n; ++j){
            cin >> a[i][j];
        }
    }
    for (int i = 0; i<n; ++i){
        for (int j = i+1; j<n; ++j){
            bool flag = 0;
            for (int k = 0; k<n; ++k){
                if (a[i][k] + a[j][k] > x){
                    flag = 1;
                    break;
                }
            }
            if (!flag){
                graphrow[i].pb(j);
                graphrow[j].pb(i);
            }
        }
    }
    int res1 = 1, res2 = 1;
    for (int i = 0; i<n; ++i){
        if (!used[i]){
            dfs(i,0);
            res1 *= fact(cnt);
            res1%=MOD;
            cnt = 0;
        }
    }
    memset(used,0,sizeof(used));
    for (int i = 0; i<n; ++i){
        for (int j = i+1; j<n; ++j){
            bool flag = 0;
            for (int k = 0; k<n; ++k){
                if (a[k][i] + a[k][j] > x){
                    flag = 1;
                    break;
                }
            }
            if (!flag){
                graphcol[i].pb(j);
                graphcol[j].pb(i);
            }
        }
    }
    for (int i = 0; i<n; ++i){
        if (!used[i]){
            dfs(i,1);
            res2 *= fact(cnt);
            res2%=MOD;
            cnt = 0;
        }
    }
    int res = res1*res2;
    res%=MOD;
    cout << res;
}

signed main(){
    ios::sync_with_stdio(false); 
    cin.tie(NULL);
    cout.tie(NULL); 
    solve();
}
void dfs(int v, int n){
    used[v] = 1;
    cnt++;
    if (n==0){
        for (auto i:graphrow[v]){
            if (!used[i]) dfs(i, 0);
        }
    }
    else{
        for (auto i:graphcol[v]){
            if (!used[i]) dfs(i, 1);
        }
    }
}
int fact(int n){
    int res = 1;
    if (n==0) return res;
    for (int i = 1; i<=n; ++i){
        res*=i;
        res%=MOD;
    }
    return res;
}

#include <bits/stdc++.h>

#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define FOR(i,n,m) for(int i=(int)(n); i<=(int)(m); i++)
#define RFOR(i,n,m) for(int i=(int)(n); i>=(int)(m); i--)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define RITR(x,c) for(__typeof(c.rbegin()) x=c.rbegin();x!=c.rend();x++)
#define setp(n) fixed << setprecision(n)

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }

#define ll long long
#define vll vector<ll>
#define vi vector<int>
#define pll pair<ll,ll>
#define pi pair<int,int>

#define all(a) (a.begin()),(a.end())
#define rall(a) (a.rbegin()),(a.rend())
#define fi first
#define se second
#define pb push_back
#define ins insert

#define debug(a) cerr<<(a)<<endl
#define dbrep(a,n) rep(_i,n) cerr<<(a[_i])<<" "; cerr<<endl
#define dbrep2(a,n,m) rep(_i,n){rep(_j,m) cerr<<(a[_i][_j])<<" "; cerr<<endl;}

using namespace std;

template<class A, class B>
ostream &operator<<(ostream &os, const pair<A,B> &p){return os<<"("<<p.fi<<","<<p.se<<")";}
template<class A, class B>
istream &operator>>(istream &is, pair<A,B> &p){return is>>p.fi>>p.se;}

//-------------------------------------------------
//--ModInt
//-------------------------------------------------
const uint_fast64_t MOD = 1e9+7;

class mint
{
private:
    using Value = uint_fast64_t;
    Value n;
public:
    mint():n(0){}
    mint(int_fast64_t _n):n(_n<0 ? MOD-(-_n)%MOD : _n%MOD){}
    mint(const mint &m):n(m.n){}

    friend ostream& operator<<(ostream &os, const mint &a){
		return os << a.n;
	}
    friend istream& operator>>(istream &is, mint &a){
        Value temp; is>>temp;
        a = mint(temp);
        return is;
    }

    mint& operator+=(const mint &m){n+=m.n; n=(n<MOD)?n:n-MOD; return *this;}
    mint& operator-=(const mint &m){n+=MOD-m.n; n=(n<MOD)?n:n-MOD; return *this;}
    mint& operator*=(const mint &m){n=n*m.n%MOD; return *this;}
    mint& operator/=(const mint &m){return *this*=m.inv();}
    mint& operator++(){return *this+=1;}
    mint& operator--(){return *this-=1;}

    mint operator+(const mint &m) const {return mint(*this)+=m;}
    mint operator-(const mint &m) const {return mint(*this)-=m;}
    mint operator*(const mint &m) const {return mint(*this)*=m;}
    mint operator/(const mint &m) const {return mint(*this)/=m;}
    mint operator++(int){mint t(*this); *this+=1; return t;}
    mint operator--(int){mint t(*this); *this-=1; return t;}

    bool operator==(const mint &m) const {return n==m.n;}
    bool operator!=(const mint &m) const {return n!=m.n;}
    mint operator-() const {return mint(MOD-n);}

    mint pow(Value b) const {
        mint ret(1), m(*this);
        while(b){
            if (b & 1) ret*=m;
            m*=m;
            b>>=1;
        }
        return ret;
    }

    mint inv() const {return pow(MOD-2);}
};

mint comb(ll a, ll b)
{
    if (a<b) return mint(0);
    mint nume = 1;
    mint deno = 1;
    rep(i,b){
        nume*=a-i;
        deno*=i+1;
    }
    return nume/deno;
}

//-------------------------------------------------

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll N,M; cin>>N>>M;
    vll a(N);
    rep(i,N) cin>>a[i];
    ll sum = 0;
    rep(i,N) sum+=a[i];

    cout<<comb(N+M,sum+N)<<"\n";
    return 0;
}
