You are given two sequences a_1, a_2, ..., a_n and b_1, b_2, ..., b_n. Each element of both sequences is either 0, 1 or 2. The number of elements 0, 1, 2 in the sequence a is x_1, y_1, z_1 respectively, and the number of elements 0, 1, 2 in the sequence b is x_2, y_2, z_2 respectively.

You can rearrange the elements in both sequences a and b however you like. After that, let's define a sequence c as follows:

c_i = \begin{cases} a_i b_i & \mbox{if }a_i > b_i \\\ 0 & \mbox{if }a_i = b_i \\\ -a_i b_i & \mbox{if }a_i < b_i \end{cases}

You'd like to make ∑_{i=1}^n c_i (the sum of all elements of the sequence c) as large as possible. What is the maximum possible sum?

Input

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

Each test case consists of two lines. The first line of each test case contains three integers x_1, y_1, z_1 (0 ≤ x_1, y_1, z_1 ≤ 10^8) — the number of 0-s, 1-s and 2-s in the sequence a.

The second line of each test case also contains three integers x_2, y_2, z_2 (0 ≤ x_2, y_2, z_2 ≤ 10^8; x_1 + y_1 + z_1 = x_2 + y_2 + z_2 > 0) — the number of 0-s, 1-s and 2-s in the sequence b.

Output

For each test case, print the maximum possible sum of the sequence c.

Example

Input


3
2 3 2
3 3 1
4 0 1
2 3 0
0 0 1
0 0 1


Output


4
2
0

Note

In the first sample, one of the optimal solutions is:

a = \{2, 0, 1, 1, 0, 2, 1\}

b = \{1, 0, 1, 0, 2, 1, 0\}

c = \{2, 0, 0, 0, 0, 2, 0\}

In the second sample, one of the optimal solutions is:

a = \{0, 2, 0, 0, 0\}

b = \{1, 1, 0, 1, 0\}

c = \{0, 2, 0, 0, 0\}

In the third sample, the only possible solution is:

a = \{2\}

b = \{2\}

c = \{0\}
import java.io.*;
import java.util.*;


public class Codeforces {


    public static void main(String[] args) throws IOException {
        Scanner sc = new Scanner(System.in);

        int t = sc.nextInt();
        while (t-- > 0) {
            int x1 = sc.nextInt();
            int y1 = sc.nextInt();
            int z1 = sc.nextInt();
            int x2 = sc.nextInt();
            int y2 = sc.nextInt();
            int z2 = sc.nextInt();
            long ans = 0;
            int n = x1+y1+z1;

            ans = Math.max(cal(x1,y1,z1,x2,y2,z2),cal(x2,y2,z2,x1,y1,z1));

            System.out.println(cal(x1,y1,z1,x2,y2,z2));

        }





    }

    private static long cal(int x0, int x1, int x2, int y0, int y1, int y2) {

        long sum = 0;
        int min = Math.min(x2,y1);
        x2-=min;
        y1-=min;
        sum+=min*2;

        min = Math.min(x0+x2,y2);
        y2-=min;

        min = Math.min(x1,y2);
        sum-=min*2;

        return sum;

    }

    private static long cal1(int x0, int x1, int x2, int y0, int y1, int y2) {

        long sum = 0;
        int min = Math.min(x0,y2);
        x0-=min;
        y2-=min;

        min = Math.min(x1,y0);
        x1-=min;
        y0-=min;

        min = Math.min(x2,y1);
        sum+=min*2;
        x2-=min;
        y1-=min;

        sum-=Math.min(x1,y2)*2;

        return sum;

    }



}
