#include #include // cout, endl, cin #include // string, to_string, stoi #include // vector #include // min, max, swap, sort, reverse, lower_bound, upper_bound #include // pair, make_pair #include // tuple, make_tuple #include // int64_t, int*_t #include // printf #include // map #include // queue, priority_queue #include // set #include // stack #include // deque #include // unordered_map #include // unordered_set #include // bitset #include // isupper, islower, isdigit, toupper, tolower #include #include #include #include #include using namespace std; using namespace atcoder; #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define repi(i, a, b) for (int i = (int)(a); i < (int)(b); i++) #define rep2(i, m, n) for (int i = (m); i < (n); ++i) #define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i) #define drep(i, n) drep2(i, n, 0) //#define endl '\n' #define all(x) (x).begin(),(x).end() #define arr(x) (x).rbegin(),(x).rend() typedef long long ll; typedef unsigned long long ull; const ll inf=1e18; //const int inf=1e7; using graph = vector > ; using P= pair; using vi=vector; using vvi=vector; using vll=vector; using vvll=vector; using vp=vector

; using vvp=vector; using vd=vector; using vvd =vector; //string T="ABCDEFGHIJKLMNOPQRSTUVWXYZ"; //string S="abcdefghijklmnopqrstuvwxyz"; //g++ main.cpp -std=c++17 -I . //cout < bool chmin(T& a, T b) { if (a > b) { a = b; return true; } else return false; } template bool chmax(T& a, T b) { if (a < b) { a = b; return true; } else return false; } struct edge{ int to; ll cost;int dir; edge(int to,ll cost,int dir) : to(to),cost(cost),dir(dir){} }; using ve=vector; using vve=vector; using mint = modint998244353; using vm=vector; using vvm=vector; const int mod = 998244353; //int mod = 1e9+7; constexpr ll MAX = 33; ll fact[MAX],finv[MAX],inv[MAX]; void initcomb(){ fact[0]=fact[1]=1; finv[0]=finv[1]=1; inv[1]=1; for(int i=2;i par, siz; UnionFind(int n) : par(n, -1) , siz(n, 1) { } int root(int x) { if (par[x] == -1) return x; else return par[x] = root(par[x]); } bool issame(int x, int y) { return root(x) == root(y); } bool unite(int x, int y) { x = root(x), y = root(y); if (x == y) return false; //if (siz[x] < siz[y]) swap(x, y); par[y] = x; siz[x] += siz[y]; return true; } int size(int x) { return siz[root(x)]; } }; struct Compress{ vll a; map d,d2; int cnt; Compress() :cnt(0) {} void add(ll x){a.push_back(x);} void init(){ sets(a.begin(),a.end()); for(auto y:s)d[y]=cnt++; for(auto&y:a)y=d[y]; for(auto u:d)d2[u.second]=u.first; } ll to(ll x){return d[x];} //変換先 ll from(ll x){return d2[x];}//逆引き int size(){return cnt;} }; vll anss; using S=pair; using vvvi=vector; using vvvvi=vector; void solve(int test){ int h,w; cin >> h >> w; ll k; cin >> k; vector vs; vs.push_back(S(P(-1,-1),P(-1,-1))); vvvvi seen(h,vvvi(w,vvi(2,vi(2)))); S now=S(P(1,1),P(0,0)); vvi ans(h,vi(w)); string out=".#"; for(ll i=1; i<=k; i++){ if(seen[now.first.first-1][now.first.second-1][now.second.first][now.second.second]){ int id=seen[now.first.first-1][now.first.second-1][now.second.first][now.second.second]; for(int j=1; j<=id-1; j++){ ans[vs[j].first.first-1][vs[j].first.second-1]^=1; } ll num=k-(id-1); ll base=num/(vs.size()-id); ll plus=num%(vs.size()-id); for(int j=id; j1)now.first.first--; else now.second.first=0; } if(now.second.second==0){ if(now.first.second1)now.first.second--; else now.second.second=0; } } for(int j=1; j>t; rep(test,t)solve(test); for(auto ans:anss)cout << ans << endl; }