#definePROBLEM"https://judge.yosupo.jp/problem/matrix_product_mod_2"

#pragma GCC optimize("Ofast,unroll-loops")

#defineCP_ALGO_CHECKPOINT

#include"cp-algo/structures/bitpack.hpp"

#include"cp-algo/util/checkpoint.hpp"

#include<bits/stdc++.h>

}

voidsolve() {

cp_algo::checkpoint("init");

int n, m, k;

cin >> n >> m >> k;

string row;

cin >> row;

b[i] = row;

}

cp_algo::checkpoint("read");

process_precalc();

cp_algo::checkpoint("precalc");

for(int j =0; j < m; j +=64) {

for(int z =0; z <64 / K; z++) {

for(int i =0; i < n; i++) {

c[i] ^= precalc[j / K + z][uint8_t(a[i].word(j /64) >> K * z)];

}

}

}

cp_algo::checkpoint("mul");

for(int i =0; i < n; i++) {

row = c[i].to_string().substr(0, k);

cout << row <<"\n";

}

cp_algo::checkpoint("write");

cp_algo::checkpoint<1>();

}

signedmain() {