///==================================================///
///                HELLO WORLD !!                    ///
///                  IT'S ME                         ///
///               BISHAL GAUTAM                      ///
///        [ [email protected] ]               ///
///==================================================///
#include<bits/stdc++.h>
#define X first
#define Y second
#define mpp make_pair
#define nl printf("\n")
#define SZ(x) (int)(x.size())
#define pb(x) push_back(x)
#define pii pair<int,int>
#define pll pair<ll,ll>
///---------------------
#define S(a) scanf("%d",&a)
#define P(a) printf("%d",a)
#define SL(a) scanf("%lld",&a)
#define S2(a,b) scanf("%d%d",&a,&b)
#define SL2(a,b) scanf("%lld%lld",&a,&b)
///------------------------------------
#define all(v) v.begin(),v.end()
#define CLR(a) memset(a,0,sizeof(a))
#define SET(a) memset(a,-1,sizeof(a))
#define fr(i,a,n) for(int i=a;i<=n;i++)
using namespace std;
typedef long long ll;
///==========CONSTANTS=============///
///  Digit     0123456789012345678 ///
#define MX     200005
#define inf    100000000
#define MD     1000000007LL
#define eps    1e-9
///===============================///

template<typename T> T BigMod(T b,T p,T m) {
    T r=1;
    while(p) {
        if(p&1)r=(r*b)%m;
        b=(b*b)%m;
        p>>=1;
    }
    return r;
}

#define N 21
int ms;///Matrix Size GLOBAL: N

struct data {
    ll n2,n3,n5,n7;
    data() {
        n2=0,n3=0,n5=0,n7=0;
    };
    data(ll a,ll b,ll c,ll d) {
        n2=a,n3=b,n5=c,n7=d;
    }
};

struct mat {
    data m[N][N];
    mat() {};
    void unify( ) {
        for(int i=0; i<ms; i++) {
            for(int j=0; j<ms; j++) {
                if(i==j)m[i][j]=data(0,0,0,0);
                else m[i][j]=data(-1,-1,-1,-1);
            }
        }
    }
};

data MaxData(data a,data b) {
    if(a.n2==-1 && b.n2==-1)return a; ///Both zeros
    if(a.n2==-1) return b;
    if(b.n2==-1) return a;

    long double lg=0.0,lg1,lg2;

    lg+=(a.n2*1.0*log(2.0));
    lg+=(a.n3*1.0*log(3.0));
    lg+=(a.n5*1.0*log(5.0));
    lg+=(a.n7*1.0*log(7.0));
    lg1=lg;

    lg=0.0;
    lg+=(b.n2*1.0*log(2.0));
    lg+=(b.n3*1.0*log(3.0));
    lg+=(b.n5*1.0*log(5.0));
    lg+=(b.n7*1.0*log(7.0));

    if( lg1>lg ) return a;
    else return b;
}

data Multi(data a,data b) {
    return data(a.n2+b.n2,a.n3+b.n3,a.n5+b.n5,a.n7+b.n7);
}

data MakeData(int n) {
    if(n==0) return data(-1,-1,-1,-1);
    data ret;
    while(n%2==0)ret.n2++,n/=2;
    while(n%3==0)ret.n3++,n/=3;
    while(n%5==0)ret.n5++,n/=5;
    while(n%7==0)ret.n7++,n/=7;
    return ret;
}

void Print(data ret) {
    cout<<ret.n2<< " "<<ret.n3<< " "<<ret.n5<< " "<<ret.n7<< " ";
}

mat b,ret;
mat operator *(mat a,mat b) {
    mat c;
    for(int i=0; i<ms; i++) {
        for(int j=0; j<ms; j++) {
            c.m[i][j]=data(-1,-1,-1,-1);
            for(int k=0; k<ms; k++) {
                c.m[i][j]=MaxData( c.m[i][j], Multi( a.m[i][k], b.m[k][j] ) );
            }
        }
    }
    return c;
}

void Matex(int p) {
    mat B = b;
    ret.unify();
    while(p) {
        if(p & 1)ret = (ret * B);
        B = (B * B);
        p >>= 1;
    }
}

int main() {
    int tc,n,cs=1,i,x,p,s,f,j,k,L;
    S(n);
    S(p);
    S2(s,f);
    S(L);

    ms=n;

    fr(i,0,ms-1) {
        fr(j,0,ms-1) {
            S(x);
            b.m[i][j]=MakeData(x);
        }
    }

    Matex(L);
    ll ans=p;
    data rs=ret.m[s][f];
    ans=(ans*BigMod(2LL,rs.n2,MD))%MD;
    ans=(ans*BigMod(3LL,rs.n3,MD))%MD;
    ans=(ans*BigMod(5LL,rs.n5,MD))%MD;
    ans=(ans*BigMod(7LL,rs.n7,MD))%MD;

    printf("%lld\n",ans);
    return 0;
}