#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#pragma GCC optimize("O3")
#pragma GCC target("avx")
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto& (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define sar(a,n) cout<<#a<<":";rep(pachico,n)cout<<" "<<a[pachico];cout<<endl
#define svec(v) cout<<#v<<":";rep(pachico,v.size())cout<<" "<<v[pachico];cout<<endl
#define svecp(v) cout<<#v<<":";each(pachico,v)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
#define sset(s) cout<<#s<<":";each(pachico,s)cout<<" "<<pachico;cout<<endl
#define smap(m) cout<<#m<<":";each(pachico,m)cout<<" {"<<pachico.first<<":"<<pachico.second<<"}";cout<<endl
 
using namespace std;
 
typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;
 
const int MAX_N = 100005;
 
template<typename T> class mat : public vector<vector<T> > {
private:
    int r,c;    //行,列
public:
    inline int row() const {
        return r;
    }
    inline int column() const {
        return c;
    }
    mat(int n, int m, T val = 0){
        r = n, c = m;
        for(int i = 0; i < n + 3; i++){
            this->push_back(vector<T>(m + 3, val));
        }
    }
    mat operator+(const mat& another) const {
        if(r != another.r && c != another.c){
            cout << "足し算失敗(サイズ不一致)" << endl;
            exit(1);
        }
        mat<T> X(r, c);
        for(int i = 0; i < r; i++){
            for(int j = 0; j < c; j++){
                X[i][j] = (*this)[i][j] + another[i][j];
            }
        }
        return X;
    }
    mat operator+(const T val) const {
        mat<T> X(r,c);
        for(int i = 0; i < r; i++){
            for(int j = 0; j < c; j++){
                X[i][j] = (*this)[i][j] + val;
            }
        }
        return X;
    }
    mat operator-(const mat& another) const {
        if(r != another.r && c != another.c){
            cout << "引き算失敗(サイズ不一致)" << endl;
            exit(1);
        }
        mat<T> X(r,c);
        for(int i = 0; i < r; i++){
            for(int j = 0; j < c; j++){
                X[i][j] = (*this)[i][j] - another[i][j];
            }
        }
        return X;
    }
    mat operator-(const T val) const {
        mat<T> X(r,c);
        for(int i = 0; i < r; i++){
            for(int j = 0; j < c; j++){
                X[i][j] = (*this)[i][j] - val;
            }
        }
        return X;
    }
    vector<T> operator*(const vector<T>& another) const {
        if(c != (int)another.size()){
            cout << "掛け算失敗(サイズ不一致)" << endl;
            exit(1);
        }
        vector<T> vec(r,0);
        for(int i = 0; i < r; i++){
            for(int j = 0; j < c; j++){
                vec[i] ^= (*this)[i][j] & another[j];
            }
        }
        return vec;
    }
    mat operator*(const mat& another) const {
        mat<T> X(r,another.c);
        for(int i = 0; i < r; i++){
            for(int k = 0; k < c; k += 4){
                for(int j = 0; j < (another.c); j += 2){
                    X[i][j] ^= ((*this)[i][k] & another[k][j]) ^ ((*this)[i][k+1] & another[k+1][j]) ^ ((*this)[i][k+2] & another[k+2][j]) ^ ((*this)[i][k+3] & another[k+3][j]);
                    X[i][j+1] ^= ((*this)[i][k] & another[k][j+1]) ^ ((*this)[i][k+1] & another[k+1][j+1]) ^ ((*this)[i][k+2] & another[k+2][j+1]) ^ ((*this)[i][k+3] & another[k+3][j+1]);
                }
            }
        }
        return X;
    }
    mat operator-() const {
        mat<T> X(r,c);
        for(int i = 0; i < r; i++){
            for(int j = 0; j < c; j++){
                X[i][j] = -(*this)[i][j];
            }
        }
        return X;
    }
    int rank() const{
        int res = 0;
        mat B(r, c);
        for(int i = 0; i < r; i++){
            for(int j = 0; j < c; j++){
                B[i][j] = (*this)[i][j];
            }
        }
        for(int i = 0; i < c; i++){
            if(res == r) return res;
            int pivot = res;
            for(int j = res + 1; j < r; j++){
                if(abs(B[j][i]) > abs(B[pivot][i])){
                    pivot = j;
                }
            }
            if(abs(B[pivot][i]) < EPS) continue;
            swap(B[pivot],B[res]);
            for(int j = i + 1; j < c; j++){
                B[res][j] /= B[res][i];
            }
            for(int j = res + 1; j < r; j++){
                for(int k = i + 1; k < c; k++){
                    B[j][k] ^= B[res][k] & B[j][i];
                }
            }
            res++;
        }
        return res;
    }
    T det() const {
        T ans = 1;
        mat B(r, r);
        for(int i = 0; i < r; i++){
            for(int j = 0; j < r; j++){
                B[i][j] = (*this)[i][j];
            }
        }
        for(int i = 0; i < r; i++){
            for(int j = i + 1; j < r; j++){
                for (; B[j][i] != 0; ans = -ans) {
                    T r = B[i][i] / B[j][i];
                    for(int k = i; k < r; k++) {
                        T t = B[i][k] - r * B[j][k];
                        B[i][k] = B[j][k];
                        B[j][k] = t;
                    }
                }
           }
           ans *= B[i][i];
       }
       return ans;
    }
    mat inverse() const {
        if(r != c){
            cout << "正方行列でない(逆行列定義不可)" << endl;
            exit(1);
        }
        mat B(r, 2*r);
        for(int i = 0; i < r; i++){
            for(int j = 0; j < r; j++){
                B[i][j] = (*this)[i][j];
            }
        }
        for(int i = 0; i < r; i++){
            B[i][r+i] = 1;
        }
        for(int i = 0; i < r; i++){
            int pivot = i;
            for(int j = i; j < r; j++){
                if(abs(B[j][i]) > abs(B[pivot][i])){
                    pivot = j;
                }
            }
            if(abs(B[pivot][i]) < EPS){
                cout << "解なしor不定" << endl;
                exit(1);
            }
            swap(B[i],B[pivot]);
            for(int j = i + 1; j < 2*r; j++){
                B[i][j] /= B[i][i];
            }
            for(int j = 0; j < r; j++){
                if(i != j){
                    for(int k = i + 1; k < 2*r; k++){
                        B[j][k] ^= B[j][i] & B[i][k];
                    }
                }
            }
        }
        mat res(r, r);
        for(int i = 0; i < r; i++){
            for(int j = 0; j < r; j++){
                res[i][j] = B[i][r+j];
            }
        }
        return res;
    }
    inline void print() const {
        for(int i = 0; i < r; i++){
            for(int j = 0; j < (c-1); j++){
                cout << (*this)[i][j] << ",";
            }
            cout << (*this)[i][c-1] << endl;
        }
    }
};
 
template<typename T> vector<T> eq_solve(const mat<T>& A,const vector<T>& b){
    int n = A.row();
    mat<T> B(n,n+1);
    for(int i = 0; i < n; i++){
        for(int j = 0; j < n; j++){
            B[i][j] = A[i][j];
        }
    }
    for(int i = 0; i < n; i++){
        B[i][n] = b[i];
    }
    for(int i = 0; i < n; i++){
        int pivot = i;
        for(int j=i;j<n;j++){
            if(abs(B[j][i]) > abs(B[pivot][i])){
                pivot = j;
            }
        }
        swap(B[i],B[pivot]);
        for(int j = 0; j < n; j++){
            if(i != j){
                for(int k=i+1;k<=n;k++){
                    B[j][k] ^= B[j][i] & B[i][k];
                }
            }
        }
    }
    vector<T> res(n);
    for(int i = 0; i < n; i++){
        res[i] = B[i][n];
    }
    return res;
}
 
template<typename T> mat<T> pow(mat<T> A, long long cnt)
{
    int n = A.row();
    mat<T> B(n, n);
    for(int i = 0; i < n; i++){
        B[i][i] = 1;
    }
    while(cnt > 0){
        if(cnt & 1) B = B * A;
        A = A * A;
        cnt >>= 1;
    }
    return B;
}
 
template<typename T> mat<T> mod_mul(mat<T>& A,mat<T>& B)
{
    if(A.column() != B.row()){
        cout << "掛け算失敗(サイズ不一致)" << endl;
        exit(1);
    }
    mat<T> X(A.row(),B.column());
    for(int i = 0; i < A.row(); i++){
        for(int k = 0; k < A.column(); k++){
            for(int j = 0; j < B.column(); j++){
                X[i][j] = (X[i][j] + A[i][k]*B[k][j]) % MOD;
            }
        }
    }
    return X;
}
 
template<typename T> mat<T> mod_pow(mat<T> A,long long cnt)
{
    if(A.row() != A.column()){
        cout << "累乗不可" << endl;
    }
    int n = A.row();
    mat<T> B(n,n);
    for(int i = 0; i < n; i++){
        B[i][i] = 1;
    }
    while(cnt>0){
        if(cnt & 1) B = mod_mul(B,A);
        A = mod_mul(A,A);
        cnt >>= 1;
    }
    return B;
}

#define getchar getchar_unlocked

inline int in() {
    int n = 0; short c;
    while ((c = getchar()) >= '0') n = n * 10 + c - '0';
    return n;
}


int main()
{
    int n = in();
    mat<short> A(n, n), B(n, n+1);
    vector<short> v(n);
    rep(i,n){
        rep(j,n){
            A[i][j] = (getchar() - '0');
            getchar();
        }
    }
    rep(i,n){
        v[i] = (getchar() - '0');
        getchar();
        B[i][n] = v[i];
    }
    int T = in();
    mat<short> AA = pow(A, T);
    rep(i,n){
        rep(j,n){
            B[i][j] = AA[i][j];
        }
    }
    int ar = AA.rank(), br = B.rank();
    // cout << ar << " " << br << "\n";
    if(ar == br){
        if(ar < n){
            cout << "ambiguous\n";
        }else{
            auto ans = eq_solve(AA, v);
            rep(i,n-1){
                cout << ans[i] << " ";
            }
            cout << ans[n-1] << "\n";
        }
    }else{
        cout << "none\n";
    }
    return 0;
}
