////////////////////////////////////////
///  tu3 pro-con template            ///
////////////////////////////////////////
#include <cassert>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
#include <sstream>
#include <algorithm>
#include <numeric>
#include <functional>
#include <vector>
#include <queue>
#include <string>
#include <complex>
#include <stack>
#include <set>
#include <map>
#include <list>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <regex>
using namespace std;

//// MACRO ////
#define countof(a) (sizeof(a)/sizeof(a[0]))

#define REP(i,n) for (int i = 0; i < (n); i++)
#define RREP(i,n) for (int i = (n)-1; i >= 0; i--)
#define FOR(i,s,n) for (int i = (s); i < (n); i++)
#define RFOR(i,s,n) for (int i = (n)-1; i >= (s); i--)
#define pos(c,i) c.being() + (i)
#define allof(c) c.begin(), c.end()
#define aallof(a) a, countof(a)
#define partof(c,i,n) c.begin() + (i), c.begin() + (i) + (n)
#define apartof(a,i,n) a + (i), a + (i) + (n)
#define long long long

#define EPS 1e-9
#define INF (1L << 30)
#define LINF (1LL << 60)

#define PREDICATE(t,a,exp) [&](const t & a) -> bool { return exp; }
#define COMPARISON_T(t) bool(*)(const t &, const t &)
#define COMPARISON(t,a,b,exp) [&](const t & a, const t & b) -> bool { return exp; }
#define CONVERTER(TSrc,t,TDest,exp) [&](const TSrc &t)->TDest { return exp; }

inline int sign(double x) { return (abs(x) < EPS ? 0 : x > 0 ? 1 : -1); }
inline bool inRange(int val, int min, int max) { return val >= min && val < max; }
inline bool inRange(double val, double min, double max) { return val - min > -EPS && val - max < EPS; }
inline bool inRange(int x, int y, int W, int H) { return x >= 0 && x < W && y >= 0 && y < H; } // W,H含まない
template <class T> struct vevector : public vector<vector<T>> { vevector(int n = 0, int m = 0, const T &initial = T()) : vector<vector<T>>(n, vector<T>(m, initial)) { } };
template <class T> struct vevevector : public vector<vevector<T>> { vevevector(int n = 0, int m = 0, int l = 0, const T &initial = T()) : vector<vevector<T>>(n, vevector<T>(m, l, initial)) { } };
template <class T> struct vevevevector : public vector<vevevector<T>> { vevevevector(int n = 0, int m = 0, int l = 0, int k = 0, const T &initial = T()) : vector<vevevector<T>>(n, vevevector<T>(m, l, k, initial)) { } };

//// i/o helper ////

#ifdef _DEBUG
#define DEBUG WRITE
inline void readfrom(string filename) { freopen(filename.c_str(), "r", stdin); }
inline void writeto(string filename) { freopen(filename.c_str(), "w", stdout); }
#else
#define DEBUG(...)
inline void readfrom(...) { }
inline void writeto(...) { }
#endif
#ifdef ccout
#  define cout ccout
#  define endl cendl
#endif

struct _Reader { template <class T> _Reader operator ,(T &rhs) { cin >> rhs; return *this; } };
struct _Writer { bool f; _Writer() : f(false) { } template <class T> _Writer operator ,(const T &rhs) { cout << (f ? " " : "") << rhs; f = true; return *this; } };
#define READ(t,...) t __VA_ARGS__; _Reader(), __VA_ARGS__
#define WRITE(...) _Writer(), __VA_ARGS__; cout << endl

template <class T> T read() { T t; cin >> t; return t; }
template <class T> vector<T> read(int n) { vector<T> v; REP(i, n) { v.push_back(read<T>()); } return v; }
template <class T> vevector<T> read(int n, int m) { vevector<T> v; REP(i, n) v.push_back(read<T>(m)); return v; }
template <class T> vevector<T> readjag() { return read<T>(read<int>()); }
template <class T> vevector<T> readjag(int n) { vevector<T> v; REP(i, n) v.push_back(readjag<T>()); return v; }

template <class T1, class T2> inline istream & operator >> (istream & in, const pair<T1, T2> &p) { in >> p.first >> p.second; return in; }
template <class T1, class T2> inline ostream & operator << (ostream &out, const pair<T1, T2> &p) { out << p.first << " " << p.second; return out; }
template <class T> inline ostream & operator << (ostream &out, const vector<T> &v)
{
	ostringstream ss;
	for (auto x : v) ss << x << "";
	auto s = ss.str();
	out << s.substr(0, s.length());
	return out;
}

//// start up ////
void solve();


int main()
{
	solve();
	return 0;
}

// MODを法としたint
template <int MOD>
struct modint
{
	typedef int T;
	typedef long DBL_T;

	T v;
	modint(T v = 0) : v(mod(v)) { }
	bool operator == (modint i) const { return v == i.v; }
	bool operator != (modint i) const { return !(*this == i); }

	modint operator +(modint i) const { return modint(v + i.v); }
	modint operator -(modint i) const { return modint(v - i.v); }
	modint& operator -=(modint i) { *this = *this - i; return *this; }

	modint operator *(modint i) const { return FromValue((DBL_T)v * i.v % MOD); }
	static T mod(T v) { return v %= MOD, v < 0 ? v + MOD : v; }

};
template <int MOD> ostream & operator << (ostream &out, modint<MOD> v) { out << v.v; return out; }

////////////////////
/// template end ///
////////////////////

void solve()
{
	int testcases = INF;
	REP(testcase, testcases)
	{
		READ(int, m, n, d);
		if (!(m | n | d)) { break; }

		int N = n * m;
		typedef modint<2> I;
		vevector<I> x(N, N + 1);
		
		REP(i, n) REP(j, m)
		{
			x[i*m + j][i*m + j] = 1;
			FOR(k, -d, d + 1)
			{
				int l = d - abs(k);
				if (inRange(i + k, j + l, n, m)) { x[i * m + j][(i + k)*m + j + l] = 1; }
				if (inRange(i + k, j - l, n, m)) { x[i * m + j][(i + k)*m + j - l] = 1; }
			}
		}

		REP(i, N) { x[i][N] = read<int>(); }

		REP(i, N)
		{
			FOR(j, i, N) { if (x[j][i] != 0) { x[i].swap(x[j]); break; } } // pivot select
			if (x[i][i] == 0) continue;
			REP(k, N) if (k != i) if (x[k][i] != 0) FOR(j, i, N+1) x[k][j] -= x[i][j];
		}

		int result = 1;
		REP(i,N) if (x[i][i] == 0 && x[i][N] != 0) result = 0;
		WRITE(result);
	}
}

Measured memory_bytes: 2632