You are given two integers a and b. You may perform any number of operations on them (possibly zero).

During each operation you should choose any positive integer x and set a := a - x, b := b - 2x or a := a - 2x, b := b - x. Note that you may choose different values of x in different operations.

Is it possible to make a and b equal to 0 simultaneously?

Your program should answer t independent test cases.

Input

The first line contains one integer t (1 ≤ t ≤ 100) — the number of test cases.

Then the test cases follow, each test case is represented by one line containing two integers a and b for this test case (0 ≤ a, b ≤ 10^9).

Output

For each test case print the answer to it — YES if it is possible to make a and b equal to 0 simultaneously, and NO otherwise.

You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES will all be recognized as positive answer).

Example

Input


3
6 9
1 1
1 2


Output


YES
NO
YES

Note

In the first test case of the example two operations can be used to make both a and b equal to zero:

  1. choose x = 4 and set a := a - x, b := b - 2x. Then a = 6 - 4 = 2, b = 9 - 8 = 1; 
  2. choose x = 1 and set a := a - 2x, b := b - x. Then a = 2 - 2 = 0, b = 1 - 1 = 0. 
import java.io.*;
import java.util.*;
public final class code
// class code
// public class Solution
{
	static void solve()throws IOException
	{
		int n=nextInt();
		while(n-->0)
		{
			int a=nextInt();
			int b=nextInt();
			if((2*a>=b)&&(2*b>=a)&&(2*a-b)%3==0 && (2*b-a)%3==0)
				out.println("YES");
			else
				out.println("NO");
		}
	}
	
	///////////////////////////////////////////////////////////
	static final long mod=(long)(1e9+7);
	static final int inf=(int)(1e9);
	// static final long inf=(long)(1e18);
	static class Pair implements Comparable<Pair>
	{
		int first,second;
		Pair(int a,int b)
		{
			first=a;
			second=b;
		}
		public int compareTo(Pair p)
		{
			if(this.second==p.second)
				return this.first-p.first;
			return this.second-p.second;
		}
		public boolean equals(Object p)
		{
			Pair p1=(Pair)p;
			return (first==p1.first && second==p1.second);
		}
		public String toString()
		{
			return this.first+" "+this.second;
		}
		public int hashCode()
		{
			return (int)((1l*(inf+1)*this.first+this.second)%mod);
		}
	}
	static void debug(Object ... a)
	{
		System.out.print("> ");
		for(int i=0;i<a.length;i++)
			System.out.print(a[i]+" ");
		System.out.println();
	}
	static void debug(int a[]){debuga(Arrays.stream(a).boxed().toArray());}
	static void debug(long a[]){debuga(Arrays.stream(a).boxed().toArray());}
	static void debuga(Object a[])
	{
		System.out.print("> ");
		for(int i=0;i<a.length;i++)
			System.out.print(a[i]+" ");
		System.out.println();
	}
 
	
	static Random random;
	static BufferedReader br;
	static StringTokenizer st;
	static PrintWriter out;
	static String nextToken()throws IOException
	{
		while(st==null || !st.hasMoreTokens())
			st=new StringTokenizer(br.readLine());
		return st.nextToken();
	}
	static String nextLine()throws IOException
	{
		return br.readLine();
	}
	static int nextInt()throws IOException
	{
		return Integer.parseInt(nextToken());
	}
	static long nextLong()throws IOException
	{
		return Long.parseLong(nextToken());
	}
	static double nextDouble()throws IOException
	{
		return Double.parseDouble(nextToken());
	}
	public static void main(String args[])throws IOException
	{
		br=new BufferedReader(new InputStreamReader(System.in));
		out=new PrintWriter(new BufferedOutputStream(System.out));
		random=new Random();
		solve();
 
		// int t=nextInt();
		// for(int i=1;i<=t;i++)
		// {
		// 	out.print("Case #"+i+": ");
		// 	solve();
		// }
 
		out.close();
	}
}