#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
const ll inf = 1e5;
const ll mod = 1e9 + 7;
const ll MOD = 998244353;
const ll MAX = 2e5 + 1;
inline ll add(ll a, ll b) { return ((a % mod) + (b % mod)) % mod; }
inline ll sub(ll a, ll b) { return ((a % mod) - (b % mod) + mod) % mod; }
inline ll mul(ll a, ll b) { return ((a % mod) * (b % mod)) % mod; }
ll pwr(ll x, ll n) {
  if (!n) return 1;
  if (n & 1)
    return mul(x, pwr(mul(x, x), (n - 1) / 2));
  else
    return pwr(mul(x, x), n / 2);
}
ll modinv(ll n) { return pwr(n, mod - 2); }
void speed_solve() {
  ll black, white;
  cin >> black >> white;
  vector<pair<ll, ll> > ans;
  if (black <= white) {
    ll x = 2, y = 3;
    for (ll i = 0; i < black - 1; i++) {
      ans.push_back({x, y});
      x++;
      ans.push_back({x, y});
      x++;
    }
    ans.push_back({x, y});
    white -= (black - 1);
    if (white) {
      for (ll i = 0; i < 2 * (black - 1); i++) {
        ans.push_back({ans[i].first, ans[i].second - 1});
        white--;
        if (!white) {
          break;
        }
        ans.push_back({ans[i].first, ans[i].second + 1});
        white--;
        if (!white) {
          break;
        }
        i++;
      }
    }
    if (white > 4) {
      cout << "NO"
           << "\n";
      return;
    }
    if (white) {
      ans.push_back(
          {ans[2 * (black - 1)].first, ans[2 * (black - 1)].second - 1});
      white--;
      if (white) {
        ans.push_back(
            {ans[2 * (black - 1)].first, ans[2 * (black - 1)].second + 1});
        white--;
        if (white) {
          ans.push_back(
              {ans[2 * (black - 1)].first + 1, ans[2 * (black - 1)].second});
          white--;
          if (white) {
            ans.push_back({ans[0].first - 1, ans[0].second});
          }
        }
      }
    }
  } else {
    ll x = 2, y = 2;
    for (ll i = 0; i < white - 1; i++) {
      ans.push_back({x, y});
      x++;
      ans.push_back({x, y});
      x++;
    }
    ans.push_back({x, y});
    black -= (white - 1);
    if (black) {
      for (ll i = 0; i < 2 * (white - 1); i++) {
        ans.push_back({ans[i].first, ans[i].second - 1});
        black--;
        if (!black) {
          break;
        }
        ans.push_back({ans[i].first, ans[i].second + 1});
        black--;
        if (!black) {
          break;
        }
        i++;
      }
    }
    if (black > 4) {
      cout << "NO"
           << "\n";
      return;
    }
    if (black) {
      ans.push_back(
          {ans[2 * (white - 1)].first, ans[2 * (white - 1)].second - 1});
      black--;
      if (black) {
        ans.push_back(
            {ans[2 * (white - 1)].first, ans[2 * (white - 1)].second + 1});
        black--;
        if (black) {
          ans.push_back(
              {ans[2 * (white - 1)].first + 1, ans[2 * (white - 1)].second});
          black--;
          if (black) {
            ans.push_back({ans[0].first - 1, ans[0].second});
          }
        }
      }
    }
  }
  cout << "YES"
       << "\n";
  for (auto [x, y] : ans) {
    cout << x << " " << y << "\n";
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  ll test_cases = 1;
  cin >> test_cases;
  for (ll i = 0; i < test_cases; i++) {
    speed_solve();
  }
  return 0;
}
