#include <iostream>
#include <fstream>
#include <string>
#include <vector>
#include <set>
#include <map>
#include <algorithm>
#include <queue>
#include <iomanip>
#include <cassert>
#include <cmath>

using namespace std;
using ll = long long;
using ld = long double;

const int inf = 1e9;

void solve() {
    int n, m;
    cin >> n >> m;
    if (n == 1 && m == 1) {
        cout << "Yes\n";
        cout << "0\n";
        cout << "0\n";
        return;
    }
    if (n == 1) {
        cout << "Yes\n";
        cout << "1\n";
        for (int i = 0; i < m; i++) {
            cout << i << ' ';
        }
        cout << '\n';
        return;
    }
    if (m == 1) {
        cout << "Yes\n";
        for (int i = 0; i < n; i++) {
            cout << i << ' ';
        }
        cout << '\n';
        cout << "1\n";
        return;
    }
    if (n == 2 && m % 2 == 1) {
        cout << "Yes\n";
        cout << "1 2\n";
        for (int i = 0; i < m; i++) {
            cout << 2 * i + 1 << ' ';
        }
        cout << '\n';
        return;
    }
    if (m == 2 && n % 2 == 1) {
        cout << "Yes\n";
        for (int i = 0; i < n; i++) {
            cout << 2 * i + 1 << ' ';
        }
        cout << '\n';
        cout << "1 2\n";
        return;
    }
    cout << "No\n";
}

signed main() {
#ifdef LOCAL
    freopen("test.in", "r", stdin);
    freopen("test.out", "w", stdout);
#endif // LOCAL
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int nrt = 1;
    cin >> nrt;
    for (int t = 1; t <= nrt; t++) {
        solve();
    }
    return 0;
}