#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;
using u128 = unsigned __int128;
using i128 = __int128;

constexpr int dx[] = {1, 0, -1, 0};
constexpr int dy[] = {0, 1, 0, -1};

std::vector<std::string> construct(int n, int m, int x, int y, int s) {
    std::vector S(n, std::string(m, '#'));
    int cur = 0;
    if (n == 1) {
        if (y < m - 1 - y) {
            for (int i = 0; i <= y; i++) {
                S[0][i] = '.';
                cur++;
            }
        } else {
            for (int i = y; i < m; i++) {
                S[0][i] = '.';
                cur++;
            }
        }
    } else if (m == 1) {
        return {};
    } else if (n == 2) {
        for (int i = 1; i < m - 1; i++) {
            S[0][i] = '.';
            cur++;
        }
        if (m == 2) {
            S[0][1] = '.';
            cur++;
        }
    } else if (m == 2) {
        return {};
    } else {
        for (int i = 1; i < n - 1; i += 2) {
            if (i == n - 2) {
                for (int j = 1; j < m - 1; j++) {
                    S[i][j] = '.';
                    cur++;
                }
                break;
            }
            for (int j = 1; j < m - 1; j++) {
                S[i][j] = '.';
                cur++;
            }
            if (i + 1 < n - 1) {
                S[i + 1][1] = '.';
                cur++;
            }
            if (i + 1 == n - 2) {
                for (int j = 3; j < m - 1; j += 2) {
                    S[i + 1][j] = '.';
                    cur++;
                }
            }
        }
        if (n % 2 == 0 && m % 2 == 0) {
            S[n - 2][m - 2] = '.';
            cur++;
        }
    }
    
    // for (int i = 0; i < n; i++) {
    //     std::cerr << S[i] << "\n";
    // }
    // std::cerr << "\n";
    // std::cerr << x << " " << y << "\n";
    
    if (S[x][y] == '#') {
        if (n == 2) {
            if (x == 1) {
                return {};
            }
            S[x][y] = '.';
            cur++;
        } else if (x == n - 1 || y == m - 1) {
            return {};
        } else if (x == 0 && y == 0) {
            S[0][0] = S[0][1] = '.';
            cur += 2;
        } else if (x == 0 || y == 0) {
            S[x][y] = '.';
            cur++;
        } else if (x < n - 2) {
            S[x][1] = '#';
            S[x][y] = '.';
        } else {
            return {};
        }
    }
    
    if (cur > s) {
        return {};
    }
    
    if (cur < s) {
        if (x >= 1 && x < n - 1 && y >= 1 && y < m - 1) {
            for (int i = y; i >= 1; i--) {
                if (S[x][i] == '#' && cur < s) {
                    cur++;
                    S[x][i] = '.';
                }
            }
            for (int i = y; i < m - 1; i++) {
                if (S[x][i] == '#' && cur < s) {
                    cur++;
                    S[x][i] = '.';
                }
            }
        }
        for (int i = 1; i < n - 1; i++) {
            for (int j = 1; j < m - 1; j++) {
                if (S[i][j] == '#' && cur < s) {
                    cur++;
                    S[i][j] = '.';
                }
            }
        }
        
        if (n == 1) {
            if (y < m - 1 - y) {
                for (int i = 0; i < m; i++) {
                    if (S[0][i] == '#' && cur < s) {
                        S[0][i] = '.';
                        cur++;
                    }
                }
            } else {
                for (int i = m - 1; i >= 0; i--) {
                    if (S[0][i] == '#' && cur < s) {
                        S[0][i] = '.';
                        cur++;
                    }
                }
            }
        } else {
            std::vector<std::array<int, 2>> border;
            for (int i = 0; i < m - 1; i++) {
                border.push_back({0, i});
            }
            for (int i = 0; i < n - 1; i++) {
                border.push_back({i, m - 1});
            }
            for (int i = m - 1; i; i--) {
                border.push_back({n - 1, i});
            }
            for (int i = n - 1; i; i--) {
                border.push_back({i, 0});
            }
            std::rotate(border.begin(), border.begin() + 1, border.end());
            for (int t = 0; t < 2; t++) {
                for (int i = 0; i < border.size(); i++) {
                    auto [x, y] = border[i];
                    auto [u, v] = border[(i - 1 + border.size()) % border.size()];
                    if (S[u][v] == '.' && S[x][y] == '#' && cur < s) {
                        cur++;
                        S[x][y] = '.';
                    }
                }
            }
            for (auto [x, y] : border) {
                if (S[x][y] == '#' && cur < s) {
                    cur++;
                    S[x][y] = '.';
                }
            }
        }
    }
    
    return S;
}

void solve() {
    int n, m;
    std::cin >> n >> m;
    
    int i, j, X;
    std::cin >> i >> j >> X;
    i--;
    j--;
    
    for (int fx = 0; fx <= 1; fx++) {
        for (int fy = 0; fy <= 1; fy++) {
            for (int tr = 0; tr <= 1; tr++) {
                int x = i;
                int y = j;
                int N = n;
                int M = m;
                if (fx) {
                    x = n - 1 - x;
                }
                if (fy) {
                    y = m - 1 - y;
                }
                if (tr) {
                    std::swap(x, y);
                    std::swap(N, M);
                }
                
                auto s = construct(N, M, x, y, X);
                if (!s.empty()) {
                    if (tr) {
                        std::vector<std::string> ns(n);
                        for (int i = 0; i < n; i++) {
                            for (int j = 0; j < m; j++) {
                                ns[i] += s[j][i];
                            }
                        }
                        s = std::move(ns);
                    }
                    if (fy) {
                        for (auto &x : s) {
                            std::reverse(x.begin(), x.end());
                        }
                    }
                    if (fx) {
                        std::reverse(s.begin(), s.end());
                    }
                    std::cout << "Yes\n";
                    for (auto &x : s) {
                        std::cout << x << "\n";
                    }
                    return;
                }
            }
        }
    }
    std::cout << "No\n";
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    
    int t;
    std::cin >> t;
    
    while (t--) {
        solve();
    }
    
    return 0;
}