#include //#include //#include //#include #define rep(i, a) for (int i = (int)0; i < (int)a; ++i) #define rrep(i, a) for (int i = (int)a - 1; i >= 0; --i) #define REP(i, a, b) for (int i = (int)a; i < (int)b; ++i) #define RREP(i, a, b) for (int i = (int)a - 1; i >= b; --i) #define repl(i, a) for (ll i = (ll)0; i < (ll)a; ++i) #define pb push_back #define eb emplace_back #define all(x) x.begin(), x.end() #define rall(x) x.rbegin(), x.rend() #define popcount __builtin_popcount #define popcountll __builtin_popcountll #define fi first #define se second using ll = long long; constexpr ll mod = 1e9 + 7; constexpr ll mod_998244353 = 998244353; constexpr ll INF = 1LL << 60; // #pragma GCC target("avx2") // #pragma GCC optimize("O3") // #pragma GCC optimize("unroll-loops") //using lll=boost::multiprecision::cpp_int; //using Double=boost::multiprecision::number>;//仮数部が1024桁 template inline bool chmin(T &a, T b) { if (a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if (a < b) { a = b; return true; } return false; } template T mypow(T x, T n, const T &p = -1) { //x^nをmodで割った余り if (p != -1) { x =(x%p+p)%p; } T ret = 1; while (n > 0) { if (n & 1) { if (p != -1) ret = (ret * x) % p; else ret *= x; } if (p != -1) x = (x * x) % p; else x *= x; n >>= 1; } return ret; } using namespace std; //using namespace atcoder; void ng(){ cout<<-1<<"\n"; exit(0); } void print(const vector> &a){ rep(i,a.size()){ rep(j,a[i].size()){ cout<>h>>w>>x; int val=x-(h-1+w-1); if(val<0)ng(); vector>ans(h,vector(w,'.')); if(h%4==3&&w%4==3){ for(int i=1;i=0;i-=2){ if(val>=abs(h-1-i)*2){ if(chmax(maxv,abs(h-1-i)*2)){ pos=i; } } } if(maxv>0){ ans[pos][j]='.'; ans[h-1][j]='#'; val-=maxv; } } if(val>0){ ans[0][w-2]='.'; ans[1][w-3]='#'; ans[h-1][w-2]='#'; for(int i=2;i+2=4){ ans[i][w-2]='.'; ans[i+2][w-2]='.'; ans[i+1][w-1]='#'; val-=4; } } } if(val>0){ ng(); }else{ print(ans); } }else if(h%4==3){ for(int i=1;i=0;i-=2){ if(val>=abs(h-1-i)*2){ if(chmax(maxv,abs(h-1-i)*2)){ pos=i; } } } if(maxv>0){ ans[pos][j]='.'; ans[h-1][j]='#'; val-=maxv; } } if(val>0){ ng(); }else{ print(ans); } }else{ for(int i=1;i=0;i-=2){ if(val>=abs(w-1-i)*2){ if(chmax(maxv,abs(w-1-i)*2)){ pos=i; } } } if(maxv>0){ ans[i][pos]='.'; ans[i].back()='#'; val-=maxv; } } if(val>0)ng(); else print(ans); } } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); cout << fixed << setprecision(15); solve(); return 0; }