#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <numeric>
#include <utility>
#include <iomanip>
#include <algorithm>
#include <functional>
using namespace std;

typedef long long ll;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef pair<int,int> pint;

#define DE 1
#define FI first
#define SE second
#define PB push_back
#define MP make_pair
#define ALL(s) (s).begin(),(s).end()
#define REP(i,n) for (int i = 0; i < (int)(n); ++i)
#define EACH(i,s) for (__typeof__((s).begin()) i = (s).begin(); i != (s).end(); ++i)
#define COUT(x) cout<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl

template<class T1, class T2> ostream& operator<<(ostream &s, pair<T1,T2> P){return s<<'<'<<P.first<<", "<<P.second<<'>';}
template<class T> ostream& operator<<(ostream &s, vector<T> P) {s<<"{ ";for(int i=0;i<P.size();++i){if(i>0)s<<", ";s<<P[i];}return s<<" }"<<endl;}
template<class T1, class T2> ostream& operator<<(ostream &s, map<T1,T2> P) {s<<"{ ";for(__typeof__(P.begin()) it=P.begin();it!=P.end();++it){if(it!=P.begin())s<<", ";s<<'<'<<it->first<<"->"<<it->second<<'>';}return s<<" }"<<endl;}




template<class T> struct Matrix {
    vector<vector<T> > val;
    Matrix(int n = 1, int m = 1) {val.clear(); val.resize(n, vector<T>(m));}
    Matrix(int n, int m, T x) {val.clear(); val.resize(n, vector<T>(m, x));}
    void resize(int n, int m) {val.clear(); val.resize(n, vector<T>(m));}
    int size() {return val.size();}
    inline vector<T>& operator [] (int i) {return val[i];}
    friend ostream& operator << (ostream& s, Matrix<T> M) {s << M.val; return s;}
};



template<class T> int Gauss_Jordan(Matrix<T> A, vector<T> b, int p) {
	int rank = 0;
    Matrix<T> M(A.size(), A[0].size()+1);
    for (int i = 0; i < A.size(); ++i) {
        for (int j = 0; j < A[0].size(); ++j) M[i][j] = A[i][j];
        M[i][A[0].size()] = b[i];
    }
//    for (int i = 0; i < M.size(); ++i) 
//        for (int j = 0; j < M[0].size(); ++j)
//            M[i][j] = mod(M[i][j], p);
    
    vint core, rem;
	for (int i = 0; i < A[0].size(); ++i) {
		int pivot = rank;
        bool exist = false;
        for (int j = rank; j < M.size(); ++j) {
            if (M[j][i] != 0) {
                pivot = j;
                exist = true;
                break;
            }
        }
		if (exist) {
            core.PB(i);
			swap(M[pivot], M[rank]);
//            T inv = inverse(M[rank][i], p);
            for (int j = 0; j < M[0].size(); ++j) {
//                M[rank][j] = M[rank][j] * inv;
                M[rank][j] = abs(M[rank][j]);
            }
			for (int j = 0; j < M.size(); ++j) {
				if (j != rank && abs(M[j][i]) > 0) {
                    T fac = M[j][i];
					for (int k = 0; k < M[0].size(); ++k) {
                        M[j][k] = M[j][k] - M[rank][k] * fac;
                        M[j][k] = abs(M[j][k]);
                    }
				}
			}
			++rank;
        }
        else rem.PB(i);
	}
    
    for (int i = rank; i < M.size(); ++i) 
        if (abs(M[i][M[0].size()-1]) > 0) return -1;
    
    return A[0].size() - rank;
};


const int MAX = 30;
int m, n, d;
int S[MAX][MAX];

int get(int a, int b) {
    return a * m + b;
}

int main() {
    while (cin >> m >> n >> d) {
        if (m == 0) break;
        
        for (int i = 0; i < n; ++i) 
            for (int j = 0; j < m; ++j)
                cin >> S[i][j];
        
        Matrix<int> A(m*n, m*n, 0);
        vector<int> b(m*n, 0);
        for (int i = 0; i < n; ++i) {
            for (int j = 0; j < m; ++j) {
                if (S[i][j] & 1) b[get(i,j)] = 1;
                
                for (int k = 0; k < n; ++k) {
                    for (int l = 0; l < m; ++l) {
                        int dist = abs(k-i) + abs(l-j);
                        if (dist == 0 || dist == d) {
                            A[get(i,j)][get(k,l)] = 1;
                        }
                    }
                }
            }
        }
        int res = Gauss_Jordan(A, b, 2);

        if (res >= 0) cout << 1 << endl;
        else cout << 0 << endl;
    }
    
    return 0;
}


Measured memory_bytes: 5832