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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException; 
import java.io.InputStreamReader; 
import java.util.Scanner; 
import java.util.StringTokenizer; 
import java.util.*;
import java.io.*;
public class codeforces 
{ 
   static class Student{
       int x,y;//z;
        Student(int x,int y){
            this.x=x;
            this.y=y;
            //this.z=z;
        }
    }
    static int prime[];
    static void sieveOfEratosthenes(int n) 
    { 
        // Create a boolean array "prime[0..n]" and initialize 
        // all entries it as true. A value in prime[i] will 
        // finally be false if i is Not a prime, else true. 
        int pos=0;
        prime= new int[n+1]; 
        for(int p = 2; p*p <=n; p++) 
        { 
            // If prime[p] is not changed, then it is a prime 
            if(prime[p] == 0)
            { 
                // Update all multiples of p
                prime[p]=p;
                for(int i = p*p; i <= n; i += p)
                    if(prime[i]==0)
                    prime[i] = p; 
            } 
        } 
    }
/*static    class Sortbyroll implements Comparator<Student> 
{ 
    // Used for sorting in ascending order of 
    // roll number 
    public long compare(Student c, Student b) 
    {
        return c.x-b.x;
    } 
} */
static class FastReader 
    { 
        BufferedReader br; 
        StringTokenizer st; 
  
        public FastReader() 
        { 
            br = new BufferedReader(new
                     InputStreamReader(System.in)); 
        } 
  
        String next() 
        { 
            while (st == null || !st.hasMoreElements()) 
            { 
                try
                { 
                    st = new StringTokenizer(br.readLine()); 
                } 
                catch (IOException  e) 
                { 
                    e.printStackTrace(); 
                } 
            } 
            return st.nextToken(); 
        } 
  
        int nextInt() 
        { 
            return Integer.parseInt(next()); 
        } 
  
        long nextLong() 
        { 
            return Long.parseLong(next()); 
        } 
  
        double nextDouble() 
        { 
            return Double.parseDouble(next()); 
        } 
  
        String nextLine() 
        { 
            String str = ""; 
            try
            { 
                str = br.readLine(); 
            } 
            catch (IOException e) 
            { 
                e.printStackTrace(); 
            } 
            return str; 
        } 
    } 
 
    static class Edge{
        int a,b;
        Edge(int a,int b){
            this.a=a;
            this.b=b;
        }
    }
    static class Trie{
        HashMap<Character,Trie>map;
         int c;
        Trie(){
            map=new HashMap<>();
            //z=null;
            //o=null;
            c=0;
        }
    }
    //static long ans;
    static int parent[];
    static int rank[];
    static int b[];
    static int h[];
    static int ho[][];
    static int seg[];
    //static int pos;
    //static long mod=1000000000+7;
    //static int dp[][];
    static HashMap<String,Integer>map;
    static PriorityQueue<Student>q=new PriorityQueue<>();
    //static Stack<Integer>st;
   // static ArrayList<Character>ans;
    static ArrayList<ArrayList<Integer>>adj;
    //static ArrayList<ArrayList<Integer>>tr;
    static ArrayList<HashMap<Long,Student>>map1;
    static ArrayList<HashMap<Long,Long>>map2;
    //static long ans;
    static int pos;
    static Trie root;
    static long fac[];
    static int s,d;
    static int gw,gb;
    static long mod=(long)(998244353);
    static long ans1;
    static long ans2;
    static void solve()throws IOException{
        FastReader sc=new FastReader();
        int t,x,y;
        t=sc.nextInt();
        while(t>0){
            x=sc.nextInt();
            y=sc.nextInt();
            if((int)Math.abs(x-y)>2*Math.min(x,y)+1)
                System.out.println("NO");
            else{
                System.out.println("YES");
                if(x>y)
                    print(x,y,2,2);
                else
                    print(y,x,3,2);
            }
            --t;
        }
    }
    static void print(int x,int y,int l,int r){
        x-=y-1;
        StringBuilder sb=new StringBuilder();
        int tx=l,ty=r,c=0;
        while(c<=2*(y-1)){
            sb.append(tx+" "+ty+"\n");
            ++ty;
            ++c;
        }
        if(x>0)
        {
            sb.append(l+" "+(r-1)+"\n");
            --x;
        }
        if(x>0){
            sb.append(l+" "+(ty)+"\n");
            --x;
        }
        c=0;
        ty=r;
        while(c<=2*(y-1)&&x>0){
            sb.append((tx-1)+" "+ty+"\n");
            --x;
            if(x>0)
            {
                sb.append((tx+1)+" "+ty+"\n");
                --x;
            }
            ty+=2;
            ++c;
        }
        sb.setLength(sb.length()-1);
        System.out.println(sb.toString());
    }
    static void dfs2(int p,int c,long dp1[][],long dp[]){
        for(Integer x: adj.get(c)){
            if(x==p)
                continue;
            dfs2(c,x,dp1,dp);
            dp[c]=Math.max(dp[c],dp[x]);
            if(dp1[c][0]==Long.MIN_VALUE)
                dp1[c][0]=dp[x];
            else if(dp1[c][0]<=dp[x]){
                dp1[c][1]=dp1[c][0];
                dp1[c][0]=dp[x];
            }
            else
                dp1[c][1]=Math.max(dp1[c][1],dp[x]);
        }
    }
    static void dfs(int p,int c,int a[],long dp[]){
        dp[c]=a[c];
        for(Integer x: adj.get(c)){
            if(x==p)
                continue;
            dfs(c,x,a,dp);
            dp[c]+=dp[x];
        }
    }
    static void dfs(int x,int y,char f[][],int n,int m){
        f[x][y]='u';
        if(x+1<n){
            if(f[x+1][y]=='*')
                ++pos;
            if(f[x+1][y]=='.')
                dfs(x+1,y,f,n,m);
        }
        if(x-1>=0){
            if(f[x-1][y]=='*')
                ++pos;
            if(f[x-1][y]=='.')
                dfs(x-1,y,f,n,m);
        }
        if(y+1<m){
            if(f[x][y+1]=='*')
                ++pos;
            if(f[x][y+1]=='.')
                dfs(x,y+1,f,n,m);
        }
        if(y-1>=0){
            if(f[x][y-1]=='*')
                ++pos;
            if(f[x][y-1]=='.')
                dfs(x,y-1,f,n,m);
        }
    }
    static void fill(int x,int y,char f[][],int dp[][],int n,int m){
        dp[x][y]=pos;
        f[x][y]='*';
           if(x+1<n){
            if(f[x+1][y]=='u')
                fill(x+1,y,f,dp,n,m);
        }
        if(x-1>=0){
            if(f[x-1][y]=='u')
                fill(x-1,y,f,dp,n,m);
        }
        if(y+1<m){
            if(f[x][y+1]=='u')
                fill(x,y+1,f,dp,n,m);
        }
        if(y-1>=0){
            if(f[x][y-1]=='u')
                fill(x,y-1,f,dp,n,m);
        }
    }
    static boolean check(String s){
        int i=0,j=s.length()-1;
        while(i<j){
            if(s.charAt(i)!=s.charAt(j))
                return false;
            ++i;
            --j;
        }
        return true;
    }
    static void update(int s,int e,int l,int r,int in,int v){
        if(s>e||s>r||l>e)
            return;
        if(s>=l&&e<=r){
            seg[in]=v;
            return;
        }
        int mid=(s+e)/2;
        update(s,mid,l,r,2*in+1,v);
        update(mid+1,e,l,r,2*in+2,v);
        seg[in]=Math.max(seg[2*in+1],seg[2*in+2]);
    }
        static int query(int s,int e,int l,int r,int in){
        if(s>e||s>r||l>e)
            return 0;
        if(s>=l&&e<=r){
            return seg[in];
            
        }
        int mid=(s+e)/2;
        return Math.max(query(s,mid,l,r,2*in+1),
        query(mid+1,e,l,r,2*in+2));
        //seg[in]=Math.max(seg[2*in+1],seg[2*in+2]);
    }
    static double dist(long x,long y,long z,long w){
        return Math.sqrt((x-y)*(x-y)+(z-w)*(z-w));
    }
    static void add(int x,int y,Queue<Integer>q,Queue<Integer>v,int b[][]){
        q.add(x);
        v.add(y);
        b[x][y]=1;
    }
    static long nCr(long n, long r, 
                                    long p) 
    { 
        return (fac[(int)n]* modInverse(fac[(int)r], p) 
                % p * modInverse(fac[(int)(n-r)], p) 
                                    % p) % p; 
    } 
    //static int prime[];
    //static int dp[];
    public static void main(String[] args){
        //long sum=0;
        try {
                codeforces.solve();
                } catch (Exception e) {
                    e.printStackTrace();
                }
    }
       static long modInverse(long n, long p) 
    { 
        return power(n, p-(long)2,p); 
    } 
 static long power(long x, long y, long p) 
{ 
    long res = 1;      // Initialize result 
  
    x = x % p;  // Update x if it is more than or  
                // equal to p 
  
    while (y > 0) 
    { 
        // If y is odd, multiply x with result 
        if (y %(long)2!=0) 
            res = (res*x) % p; 
  
        // y must be even now 
        y = y>>1; // y = y/2 
        x = (x*x) % p;   
    } 
    return res%p;
 }
    /*public static long power(long x,long a) {
		if(a==0) return 1;
		if(a%2==1)return (x*1L*power(x,a-1))%mod;
		return (power((int)((x*1L*x)%mod),a/2))%mod;
	}*/
   static int find(int x) 
    { 
        // Finds the representative of the set 
        // that x is an element of 
        while(parent[x]!=x) 
        { 
            // if x is not the parent of itself 
            // Then x is not the representative of 
            // his set,
            x=parent[x];
  
            // so we recursively call Find on its parent 
            // and move i's node directly under the 
            // representative of this set 
        } 
  
        return x; 
    }
    static void union(int x, int y) 
    { 
        // Find representatives of two sets 
        int xRoot = find(x), yRoot = find(y); 
  
        // Elements are in the same set, no need 
        // to unite anything. 
        if (xRoot == yRoot) 
            return; 
  
         // If x's rank is less than y's rank 
        if (rank[xRoot] < rank[yRoot]) 
  
            // Then move x under y  so that depth 
            // of tree remains less 
            parent[xRoot] = yRoot; 
  
        // Else if y's rank is less than x's rank 
        else if (rank[yRoot] < rank[xRoot]) 
  
            // Then move y under x so that depth of 
            // tree remains less 
            parent[yRoot] = xRoot; 
  
        else // if ranks are the same 
        { 
            // Then move y under x (doesn't matter 
            // which one goes where) 
            parent[yRoot] = xRoot; 
  
            // And increment the the result tree's 
            // rank by 1 
            rank[xRoot] = rank[xRoot] + 1; 
        } 
    } 
    static long gcd(long a, long b) 
    { 
        if (a == 0){ 
             //ans+=b;
            return b;
        }
        return gcd(b % a, a); 
    }
}