#include <bits/stdc++.h>
using namespace std;
pair<int, int> add_pair(pair<int, int> a, pair<int, int> b) {
  return make_pair(a.first + b.first, a.second + b.second);
}
int power(int a, int b) {
  int res = 1;
  a = a % ((int)1e9 + 7);
  while (b > 0) {
    if (b & 1) {
      res = (res * a) % ((int)1e9 + 7);
      b--;
    }
    a = (a * a) % ((int)1e9 + 7);
    b >>= 1;
  }
  return res;
}
int fermat_inv(int y) { return power(y, ((int)1e9 + 7) - 2); }
int gcd(int a, int b) { return (b == 0) ? a : gcd(b, a % b); }
int mul(int a, int b) { return (a * (b % ((int)1e9 + 7))) % ((int)1e9 + 7); }
int sub(int a, int b) {
  return ((a - b) % ((int)1e9 + 7) + ((int)1e9 + 7)) % ((int)1e9 + 7);
}
int add(int a, int b) {
  return ((a + b) % ((int)1e9 + 7) + ((int)1e9 + 7)) % ((int)1e9 + 7);
}
vector<bool> vis;
vector<int> matching;
void solve() {
  int b, w, flg, i, x;
  cin >> b >> w;
  vector<pair<int, int> > ans;
  flg = 0;
  if (b < w) {
    flg = 1;
    swap(b, w);
  }
  x = 2;
  for (i = (0); i < (w); i += (1)) {
    ans.push_back({2, x});
    ans.push_back({2, x + 1});
    x += 2;
  }
  b -= w;
  if (b != 0) {
    ans.push_back({2, 1});
    b--;
    x -= 2;
    while (b != 0 && x >= 2) {
      ans.push_back({1, x});
      b--;
      if (b == 0) break;
      ans.push_back({3, x});
      b--;
      if (b == 0) break;
      x -= 2;
    }
  }
  if (b != 0)
    cout << "NO\n";
  else {
    cout << "YES\n";
    for (auto it = (ans).begin(); it != (ans).end(); it++) {
      cout << it->first << ' ' << it->second + flg << '\n';
    }
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t;
  t = 1;
  cin >> t;
  while (t--) {
    solve();
  }
  return 0;
}
