# include <bits/stdc++.h>
using namespace std;
# define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
# define int long long
# define lowbit(x) (x & (-x))
# define fi first
# define se second
// # define endl '\n'

inline int Read();

typedef pair<int, int> PII;
const int INF = 0x3f3f3f3f;
const int MOD = 998244353;
const int N = 1e6 + 10;

map <int, int> mp;

int ok(int x, int y, int z, int w){
    if(x * (x + 1) * 2 / 4 == y){
        if(x + z == w) return 1;
        return 0; 
    } else if(x * (x + 1) * 2 / 4 < y) {
        return 1;
    }
    else{
       return 0; 
    } 
}
void Solve(){
    int n, m;
    cin >> n >> m;
    if((n * m * (n + 1) * (m + 1) / 4) % 2 != 0){
        cout << "No\n";
        return;
    }
    int sum = m * (m + 1) * 2 / 4;
    int t = sum / 2;
    vector <int> v;
    int l = 0, r = m, mid;
    int num = 0;
    if(sum % 2 == 0){
        while(1){
            l = 0, r = m;
            while(l < r){
                mid = l + r + 1 >> 1;
                if(ok(mid, t, num, m)) l = mid;
                else r = mid - 1;
            }
            if(l == 0) break;
            v.push_back(l);
            num += l;
            t -= l * (l + 1) * 2 / 4;
            if(t == 0) break;
            else {
                t --;
                v.push_back(1);
                num ++;
            }
            if(num == m) break;
        }
        if(num == m){
            cout << "Yes\n";
            for(int i = 1; i <= n; i ++){
                for(int j = 0; j < v.size(); j ++){
                    for(int k = 0; k < v[j]; k ++){
                    cout << (j & 1) <<" "; 
                    }
                }
                cout << '\n';
            }
            return;
        }
    }
    sum = n * (n + 1) * 2 / 4;
    t = sum / 2;
    if(sum % 2 == 0){
        num = 0;
        v.clear();
        while(1){
            l = 0, r = n;
            while(l < r){
                mid = l + r + 1 >> 1;
                if(ok(mid, t, num, n)) l = mid;
                else r = mid - 1;
            }
            if(l == 0) break;
            v.push_back(l);
            num += l;
            t -= l * (l + 1) * 2 / 4;
            if(t == 0) break;
            else {
                t --;
                v.push_back(1);
                num ++;
            }
            if(num == n) break;
        }
        if(num == n){
            cout << "Yes\n";
            int cnt = 0;
            for(int i = 0; i < v.size(); i ++){
                for(int j = 1; j <= v[i]; j ++){
                    for(int k = 0; k < m; k ++){
                        cout << (cnt & 1) <<" ";
                    }
                    cout <<"\n";
                }
                cnt ++;
            }
            return;
        }
    }
    cout << "No\n";
   
    

    
   

}
signed main(){
    // IOS;
    int T = 1;
    cin >> T;
    while (T--) 
        Solve();
    return 0;
}
inline int Read(){
    int x = 0, f = 1; char c = getchar();
    while (c < '0' || c > '9'){ if (c == '-') f = -1; c = getchar();}
    while (c >= '0' && c <= '9') x = x * 10 + c - '0', c = getchar();
    return x * f;
}