#pragma GCC target("avx2") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #include #include #include #include #include #include #include #include #include #include #include #include #include #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; template vector> vec2d(int n, int m, T v){ return vector>(n, vector(m, v)); } template vector>> vec3d(int n, int m, int k, T v){ return vector>>(n, vector>(m, vector(k, v))); } template void print_vector(vector v, char delimiter=' '){ if(v.empty()) { cout << endl; return; } for(int i = 0; i+1 < v.size(); i++) cout << v[i] << delimiter; cout << v.back() << endl; } using T = tuple; int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; int h, w; cin >> h >> w; ll k; cin >> k; auto nx = vec3d(h, w, 8, T(0, 0, 0)); for(int i = 0; i < h; i++){ for(int j = 0; j < w; j++){ for(int p = 0; p < 8; p++){ int dx = (p&1) ? -1 : 1; int dy = (p&2) ? -1 : 1; bool flip = (p&4) ? false : true; if(flip){ if(0 <= i+dx && i+dx < h){ nx[i][j][p] = T(i+dx, j, p^4); }else{ nx[i][j][p] = T(i, j, p^4^1); } }else{ if(0 <= j+dy && j+dy < w){ nx[i][j][p] = T(i, j+dy, p^4); }else{ nx[i][j][p] = T(i, j, p^4^2); } } } } } auto seen = vec3d(h, w, 8, 0ll); int x = 0, y = 0, p = 0; vector path; for(ll idx = 0; idx < k*2; idx++){ if(seen[x][y][p] > 0){ T t(x, y, p); ll head = 0; ll cycle = 0; for(int i = 0; i < path.size(); i++){ if(t == path[i]){ head = i; cycle = path.size()-head; break; } } ll cnt_cycle = (k*2-head)/cycle; ll rem = (k*2-head)%cycle; vector v_cycle; for(int i = head; i < path.size(); i++){ v_cycle.push_back(path[i]); } for(int i = 0; i < cycle; i++){ auto [xx, yy, pp] = v_cycle[i]; seen[xx][yy][pp] += cnt_cycle-1; if(i < rem){ seen[xx][yy][pp]++; } } break; } path.push_back({x, y, p}); seen[x][y][p]++; auto [xx, yy, pp] = nx[x][y][p]; x = xx; y = yy; p = pp; assert(idx < 10*h*w); } auto ans = vec2d(h, w, 0); for(int x = 0; x < h; x++){ for(int y = 0; y < w; y++){ for(int p = 0; p < 4; p++){ ans[x][y] ^= (seen[x][y][p]%2); } cout << (ans[x][y] == 0 ? '.' : '#'); } cout << '\n'; } }