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.StringTokenizer;

public class Main {
    private final static int MAX_SCORE = 205;
    private final static int MAIN_END_SCORE = 25;
    private final static int SHORT_END_SCORE = 15;
    private FastScanner in;
    private PrintWriter out;

    public static void main(String[] args) {
        (new Main()).run();
    }

    private void run() {
        try {
            in = new FastScanner(System.in);
            out = new PrintWriter(System.out);
            solution();
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            if (in != null) {
                try {
                    in.close();
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            if (out != null) out.close();
        }
    }

    private void solution() throws IOException {
        int t = in.nextInt();
        while (t-- > 0) {
            int a = in.nextInt();
            int b = in.nextInt();
            int smallest = Math.min(a, b);
            int biggest = Math.max(a, b);
            out.println(((a + b) % 3 == 0 && (biggest - smallest) <= smallest) ? "YES" : "NO");
        }
    }


    private class FastScanner {
        private BufferedReader bufferedReader;
        private StringTokenizer stringTokenizer;

        FastScanner(InputStream inputStream) {
            bufferedReader = new BufferedReader(new InputStreamReader(inputStream));
        }

        String next() throws IOException {
            while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {
                String temp = bufferedReader.readLine();
                if (temp == null) {
                    return null;
                }
                stringTokenizer = new StringTokenizer(temp);
            }
            return stringTokenizer.nextToken();
        }

        String nextLine() throws IOException {
            return bufferedReader.readLine();
        }

        int nextInt() throws IOException {
            return Integer.parseInt(this.next());
        }

        long nextLong() throws IOException {
            return Long.parseLong(this.next());
        }

        double nextDouble() throws IOException {
            return Double.parseDouble(this.next());
        }

        void close() throws IOException {
            bufferedReader.close();
        }
    }
}