Problem: You are given two integers b and w. You have a chessboard of size 10^9 × 10^9 with the top left cell at (1; 1), the cell (1; 1) is painted white.

Your task is to find a connected component on this chessboard that contains exactly b black cells and exactly w white cells. Two cells are called connected if they share a side (i.e. for the cell (x, y) there are at most four connected cells: (x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1)). A set of cells is called a connected component if for every pair of cells C_1 and C_2 from this set, there exists a sequence of cells c_1, c_2, ..., c_k such that c_1 = C_1, c_k = C_2, all c_i from 1 to k are belong to this set of cells and for every i ∈ [1, k - 1], cells c_i and c_{i + 1} are connected.

Obviously, it can be impossible to find such component. In this case print "NO". Otherwise, print "YES" and any suitable connected component.

You have to answer q independent queries.

Input

The first line of the input contains one integer q (1 ≤ q ≤ 10^5) — the number of queries. Then q queries follow.

The only line of the query contains two integers b and w (1 ≤ b, w ≤ 10^5) — the number of black cells required and the number of white cells required.

It is guaranteed that the sum of numbers of cells does not exceed 2 ⋅ 10^5 (∑ w + ∑ b ≤ 2 ⋅ 10^5).

Output

For each query, print the answer to it.

If it is impossible to find the required component, print "NO" on the first line.

Otherwise, print "YES" on the first line. In the next b + w lines print coordinates of cells of your component in any order. There should be exactly b black cells and w white cells in your answer. The printed component should be connected.

If there are several answers, you can print any. All coordinates in the answer should be in the range [1; 10^9].

Example

Input


3
1 1
1 4
2 5


Output


YES
2 2
1 2
YES
2 3
1 3
3 3
2 2
2 4
YES
2 3
2 4
2 5
1 3
1 5
3 3
3 5

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int maxi = 1e6 + 10;
long long a[maxi];
vector<int> v[maxi];
int n;
string s;
char ch[maxi];
string val[3];
int sum[3][maxi];
map<pair<int, int>, int> mp, mp1;
int dx[4] = {0, 0, 1, -1};
int dy[4] = {1, -1, 0, 0};
int inside(int x, int y) { return (x >= 1 && x <= 1e9 && y >= 1 && y <= 1e9); }
void solve() {
  int b, w;
  scanf("%d%d", &b, &w);
  vector<pair<int, int>> ans;
  stack<pair<int, int>> st;
  mp.clear();
  mp1.clear();
  if (b > w) {
    st.push({100000, 100001});
    b--;
    mp[{100000, 100001}] = 1;
  } else {
    st.push({100000, 100000});
    mp[{100000, 100000}] = 1;
    w--;
  }
  while (!st.empty()) {
    pair<int, int> node = st.top();
    if (!mp1[node]) ans.push_back(node);
    mp1[node] = 1;
    int x = node.first;
    int y = node.second;
    int nasao = 0;
    for (int i = 0; i < 4; i++)
      if (inside(x + dx[i], y + dy[i]) && !mp[{x + dx[i], y + dy[i]}]) {
        if ((x + y) & 1 && w) {
          w--;
          mp[{x + dx[i], y + dy[i]}] = 1;
          st.push({x + dx[i], y + dy[i]});
          nasao = 1;
          break;
        } else if ((x + y) % 2 == 0 && b) {
          b--;
          mp[{x + dx[i], y + dy[i]}] = 1;
          st.push({x + dx[i], y + dy[i]});
          nasao = 1;
          break;
        }
      }
    if (!nasao) st.pop();
  }
  if (b || w) {
    printf("NO\n");
    return;
  }
  printf("YES\n");
  for (auto i : ans) printf("%d %d\n", i.first, i.second);
}
int main() {
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}