#pragma GCC optimize ("O3")

#include <iostream>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <queue>
#include <set>
#include <algorithm>
#include <numeric>
#include <list>
using namespace std;

using QWORD  = uint64_t;
using SQWORD = int64_t;
using DWORD  = uint32_t;
using SDWORD = int32_t;
using WORD   = uint16_t;
using SWORD  = int16_t;
using BYTE   = uint8_t;
using SBYTE  = int8_t;
using DOUBLE = double;
using FLOAT  = float;

#define MIN_SDWORD (-2147483648)
#define MAX_SDWORD (2147483647)
#define MIN_SBYTE (-128)
#define MAX_SBYTE (127)

#define MIN_SQWORD (0x8000000000000000)
#define MAX_SQWORD (0x7FFFFFFFFFFFFFFF)

#define MAX_QWORD  (0xFFFFFFFFFFFFFFFF)
#define MAX_DWORD  (0xFFFFFFFF)
#define MAX_WORD   (0xFFFF)
#define MAX_BYTE   (0xFF)

#define MAX_DOUBLE      (1.0e+308)
#define DOUBLE_EPS      (1.0e-12)
#define MIN_DOUBLE_N    (-1.0e+308)

#define ArrayLength(a)  (sizeof(a) / sizeof(a[0]))

static inline DOUBLE MAX(DOUBLE a, DOUBLE b) { return a > b ? a : b; }
static inline QWORD MAX(QWORD a, QWORD b) { return a > b ? a : b; }
static inline DWORD MAX(DWORD a, DWORD b) { return a > b ? a : b; }
static inline SDWORD MAX(SDWORD a, SDWORD b) { return a > b ? a : b; }
static inline DOUBLE MIN(DOUBLE a, DOUBLE b) { return a < b ? a : b; }
static inline QWORD MIN(QWORD a, QWORD b) { return a < b ? a : b; }
static inline DWORD MIN(DWORD a, DWORD b) { return a < b ? a : b; }
static inline SDWORD MIN(SDWORD a, SDWORD b) { return a < b ? a : b; }

#define BYTE_BITS   (8)
#define WORD_BITS   (16)
#define DWORD_BITS  (32)
#define QWORD_BITS  (64)

static inline void inputStringSpSeparated(char *pcStr)
{
    char *pcCur = pcStr;
    for (;;) {
        char c = getchar();
        if (('\n' == c) || (EOF == c) || (' ' == c)) {
            break;
        }
        *pcCur = c;
        pcCur++;
    }
    *pcCur = '\0';
}

static inline void inputString(char *pcStr)
{
    char *pcCur = pcStr;
    for (;;) {
        char c = getchar();
        if (('\n' == c) || (EOF == c)) {
            break;
        }
        *pcCur = c;
        pcCur++;
    }
    *pcCur = '\0';
}


static inline SQWORD inputSQWORD(void)
{
    SQWORD sqNumber = 0;
    SQWORD sqMultiplier = 1;
    bool bRead = false;
    for (;;) {
        char c = getchar();
        if (!bRead) {
            if ('-' == c) {
                sqMultiplier = -1;
            }
        }
        if (('0' <= c) && (c <= '9')) {
            sqNumber *= 10LL;
            sqNumber += (SQWORD)(c - '0');
            bRead = true;
        } else {
            if (bRead) {
                return sqNumber * sqMultiplier;
            }
        }
    }
}


static inline SDWORD inputSDWORD(void)
{
    SDWORD lNumber = 0;
    SDWORD lMultiplier = 1;
    bool bRead = false;
    for (;;) {
        char c = getchar();
        if (!bRead) {
            if ('-' == c) {
                lMultiplier = -1;
            }
        }
        if (('0' <= c) && (c <= '9')) {
            lNumber *= 10;
            lNumber += (c - '0');
            bRead = true;
        } else {
            if (bRead) {
                return lNumber * lMultiplier;
            }
        }
    }
}

static inline DOUBLE inputFP(void)
{
    DOUBLE dInt = 0.0;
    DOUBLE dFrac = 0.0;
    DOUBLE dMultiplier = 1.0;
    DWORD dwFpCnt = 0;
    DOUBLE *pdCur = &dInt;
    bool bRead = false;
    for (;;) {
        char c = getchar();
        if (!bRead) {
            if ('-' == c) {
                dMultiplier = -1;
            }
        }
        if ('.' == c) {
            pdCur = &dFrac;
        } else if (('0' <= c) && (c <= '9')) {
            (*pdCur) *= 10;
            (*pdCur) += (DOUBLE)(c - '0');
            bRead = true;
            if (pdCur == &dFrac) {
                dwFpCnt++;
            }
        } else {
            if (bRead) {
                return dMultiplier * (dInt + dFrac / (pow((DOUBLE)10.0 , (DOUBLE)dwFpCnt)));
            }
        }
    }
}


/**
 *  mod による操作ライブラリ
 */

#define ANS_MOD (1000000007LL)
 
static SQWORD addMod(SQWORD x, SQWORD y)
{ 
    return (x + y) % ANS_MOD;
}
 
static SQWORD subMod(SQWORD x, SQWORD y)
{
    return (x - y + ANS_MOD) % ANS_MOD;
}
 
static SQWORD mulMod(SQWORD x, SQWORD y) 
{
    return (x * y) % ANS_MOD;
}
 
static SQWORD powMod(SQWORD x, SQWORD e) {
    SQWORD v = 1;
    for (; e; x = mulMod(x, x), e >>= 1) {
        if (e & 1) {
            v = mulMod(v, x);
        }
    }
    return v;
}
 
static SQWORD divMod(SQWORD x, SQWORD y)
{
    return mulMod(x, powMod(y, ANS_MOD - 2));
}
 
 
static SQWORD combMod(SQWORD n, SQWORD k)
{
    SQWORD v=1;
    for(SQWORD i=1; i<=k; i++) {
        v = divMod(mulMod(v, n-i+1),i);
    } 
    return v;
}

/*----------------------------------------------*/

class Matrix {
private:
    SQWORD nRows;
    SQWORD nCols;
    vector<SQWORD> vecsqVal;

    SQWORD getIdx(SQWORD r, SQWORD c) {
        return r * nCols + c;
    }
    SQWORD op_sub(SQWORD a, SQWORD b) {
        return (a^b);
    }

public:
    Matrix(SQWORD r, SQWORD c) : nRows(r), nCols(c) {
        vecsqVal.resize(r * c);
    };
    void setValue(SQWORD r, SQWORD c, SQWORD v) {
        SQWORD sqIdx = getIdx(r, c);
        vecsqVal[sqIdx] = v;
    };
    SQWORD getValue(SQWORD r, SQWORD c) {
        SQWORD sqIdx = getIdx(r, c);
        return vecsqVal[sqIdx];
    }
    SQWORD getRowNum(void) {return nRows;};
    SQWORD getColNum(void) {return nCols;};
    void swapRows(SQWORD r1, SQWORD r2) {
        for (SQWORD sqColIdx = 0; sqColIdx < nCols; sqColIdx++) {
            SQWORD sqIdx1 = getIdx(r1, sqColIdx);
            SQWORD sqIdx2 = getIdx(r2, sqColIdx);
            swap(vecsqVal[sqIdx1], vecsqVal[sqIdx2]);
        }
    }
    void diffRows(SQWORD r1, SQWORD r2) {
        for (SQWORD sqColIdx = 0; sqColIdx < nCols; sqColIdx++) {
            SQWORD sqIdx1 = getIdx(r1, sqColIdx);
            SQWORD sqIdx2 = getIdx(r2, sqColIdx);
            vecsqVal[sqIdx1] = op_sub(vecsqVal[sqIdx1], vecsqVal[sqIdx2]);
        }
    }
    void print(void) 
    {  
        printf("---!\n");
        for (SQWORD sqRowIdx = 0; sqRowIdx < nRows; sqRowIdx++) {
            for (SQWORD sqColIdx = 0; sqColIdx < nCols; sqColIdx++) {
                SQWORD sqIdx = getIdx(sqRowIdx, sqColIdx);
                printf("%d ", vecsqVal[sqIdx]);
            }
            printf("\n");
        }
        printf("---!\n");
    }

    bool solve1DEquation(SQWORD& sqRank) {
        sqRank = 0;
        for (SQWORD sqColIdx = 0; sqColIdx < nCols - 1; sqColIdx++) {
            bool bPivot = true;
//            printf("%lld %lld\n", sqColIdx, sqRank);
            if (0 == getValue(sqRank, sqColIdx)) {
                /* search non zero pivot  ->  swap rows */
                SQWORD sqSearchRow = sqRank + 1;
                for (; sqSearchRow < nRows; sqSearchRow++) {
                    if (0 != getValue(sqSearchRow, sqColIdx)) {
                        break;
                    }
                }
                if (sqSearchRow == nRows) {
                    /* All Zero */
                    bPivot = false;
                } else {
//                    printf("   s[%lld %lld]\n", sqRank, sqSearchRow);
                    swapRows(sqRank, sqSearchRow);
//                    print();
                }
            }
            /* pivot */
            if (bPivot) {
                for (SQWORD sqTargetRow = 0; sqTargetRow < nRows; sqTargetRow++) {
                    if (sqTargetRow != sqRank) {
                        if (1 == getValue(sqTargetRow, sqColIdx)) {
//                           printf("   d[%lld %lld]\n", sqTargetRow, sqRank);
                            diffRows(sqTargetRow, sqRank);
                        }
                    }
                }
                sqRank++;
            }
        }
        return true;
    }
};

#define     N_MAX_ROW   (25)
#define     N_MAX_COL   (25)
#define     N_MAX_DIM   (N_MAX_ROW * N_MAX_COL)
#define     N_MAX_EQ_ROWS   (N_MAX_DIM)
#define     N_MAX_EQ_COLS   (N_MAX_DIM + 1)

static SQWORD getEqCoeffIdx(
    SQWORD sqRowIdx,
    SQWORD sqColIdx,
    SQWORD sqNrows,
    SQWORD sqNcols)
{
    return sqRowIdx * sqNcols + sqColIdx;
}

static bool isInrange(
    SQWORD sqRowIdx,
    SQWORD sqColIdx,
    SQWORD sqNrows,
    SQWORD sqNcols)
{
    return (((0 <= sqRowIdx) && (sqRowIdx < sqNrows))
            && ((0 <= sqColIdx) && (sqColIdx < sqNcols)));
}

static void configureCoeffs(
    Matrix &Ary,
    SQWORD sqNrows,
    SQWORD sqNcols,
    SQWORD sqDist) 
{
    for (SQWORD sqRowIdx = 0; sqRowIdx < sqNrows; sqRowIdx++) {
        for (SQWORD sqColIdx = 0; sqColIdx < sqNcols; sqColIdx++) {
            SQWORD sqEqIdx = getEqCoeffIdx(sqRowIdx, sqColIdx, sqNrows, sqNcols);
            for (SQWORD sqFlipRowIdx = sqRowIdx - sqDist; sqFlipRowIdx <= sqRowIdx + sqDist; sqFlipRowIdx++) {
                SQWORD sqFlipCol1Idx = sqColIdx + (sqDist - abs(sqRowIdx - sqFlipRowIdx));
                SQWORD sqFlipCol2Idx = sqColIdx - (sqDist - abs(sqRowIdx - sqFlipRowIdx));

                if (isInrange(sqFlipRowIdx, sqFlipCol1Idx, sqNrows, sqNcols)) {
                    SQWORD sqCoeffIdx = getEqCoeffIdx(sqFlipRowIdx, sqFlipCol1Idx, sqNrows, sqNcols);
                    Ary.setValue(sqEqIdx, sqCoeffIdx, 1);
                }
                if (isInrange(sqFlipRowIdx, sqFlipCol2Idx, sqNrows, sqNcols)) {
                    SQWORD sqCoeffIdx = getEqCoeffIdx(sqFlipRowIdx, sqFlipCol2Idx, sqNrows, sqNcols);
                    Ary.setValue(sqEqIdx, sqCoeffIdx, 1);
                }
            }
            /* 対角成分 */
            Ary.setValue(sqEqIdx, sqEqIdx, 1);
        }
    }
}

bool solve(void)
{
    SQWORD sqInput_M = inputSQWORD();
    SQWORD sqInput_N = inputSQWORD();

    SQWORD sqDim = sqInput_M * sqInput_N;

    SQWORD sqInput_D = inputSQWORD();

    if ((0 == sqInput_M) && (0 == sqInput_M) && (0 == sqInput_D)) {
        return false;
    }

    /* Coeff & ans */
    Matrix matEq(sqDim, sqDim+1);

    /* Configure A */
    configureCoeffs(matEq, sqInput_N, sqInput_M, sqInput_D);

    /* input b */
    for (SQWORD sqRowIdx = 0; sqRowIdx < sqInput_N; sqRowIdx++) {
        for (SQWORD sqColIdx = 0; sqColIdx < sqInput_M; sqColIdx++) {
            SQWORD sqInput_S = inputSQWORD();
            SQWORD sqEqIdx = getEqCoeffIdx(sqRowIdx, sqColIdx, sqInput_N, sqInput_M);
            matEq.setValue(sqEqIdx, sqDim, sqInput_S);
        }
    }

    /* solve */
    SQWORD sqRank;
    matEq.solve1DEquation(sqRank);

    bool bAnsExist = true;
    for (SQWORD sqIdx = sqRank; sqIdx < sqDim; sqIdx++) {
        if (0 < matEq.getValue(sqIdx, sqDim)) {
            bAnsExist = false;
        }
    }

    if (bAnsExist) {
        printf("1\n");
    } else {
        printf("0\n");
    }
    return true;
}

int main(void)
{
    while(1) {
        if (!solve()) {
            break;
        }
    }

    return 0;
}


Measured memory_bytes: 8692