Tired of boring office work, Denis decided to open a fast food restaurant.

On the first day he made a portions of dumplings, b portions of cranberry juice and c pancakes with condensed milk.

The peculiarity of Denis's restaurant is the procedure of ordering food. For each visitor Denis himself chooses a set of dishes that this visitor will receive. When doing so, Denis is guided by the following rules:

  * every visitor should receive at least one dish (dumplings, cranberry juice, pancakes with condensed milk are all considered to be dishes); 
  * each visitor should receive no more than one portion of dumplings, no more than one portion of cranberry juice and no more than one pancake with condensed milk; 
  * all visitors should receive different sets of dishes. 



What is the maximum number of visitors Denis can feed?

Input

The first line contains an integer t (1 ≤ t ≤ 500) — the number of test cases to solve.

Each of the remaining t lines contains integers a, b and c (0 ≤ a, b, c ≤ 10) — the number of portions of dumplings, the number of portions of cranberry juice and the number of condensed milk pancakes Denis made.

Output

For each test case print a single integer — the maximum number of visitors Denis can feed.

Example

Input

7
1 2 1
0 0 0
9 1 7
2 2 3
2 3 2
3 2 2
4 4 4


Output

3
0
4
5
5
5
7

Note

In the first test case of the example, Denis can feed the first visitor with dumplings, give the second a portion of cranberry juice, and give the third visitor a portion of cranberry juice and a pancake with a condensed milk.

In the second test case of the example, the restaurant Denis is not very promising: he can serve no customers.

In the third test case of the example, Denise can serve four visitors. The first guest will receive a full lunch of dumplings, a portion of cranberry juice and a pancake with condensed milk. The second visitor will get only dumplings. The third guest will receive a pancake with condensed milk, and the fourth guest will receive a pancake and a portion of dumplings. Please note that Denis hasn't used all of the prepared products, but is unable to serve more visitors.
def restaurant(n):
    def cost(d):
        dinners = {
            1: [0, 0, 1],
            2: [0, 1, 0],
            3: [1, 0, 0],
            4: [0, 1, 1],
            5: [1, 1, 0],
            6: [1, 0, 1],
            7: [1, 1, 1]
        }
        result = [0, 0, 0]
        count = 0
        for i in range(1, len(d) + 1):
            if d[i-1] == 1:
                count += 1
                for j in range(len(result)):
                    result[j] += dinners[i][j]
        return count, result

    n = n.split()
    n1 = int(n[0])
    n2 = int(n[1])
    n3 = int(n[2])
    t = []

    for i in range(128):
        b = list(map(int, bin(i)[2:]))
        while len(b)!=7:
            b.insert(0,0)
        c, [x, y, z] = cost(b)
        #print(i, b, c, [x, y, z])
        if n1 >= x and n2 >= y and n3 >= z:
            t.append(c)
        #if n1<=res[1][0] and n2<= res[1][1] and n3<=res[1][2]:
    return max(t)



f=int(input().strip())
for i in range(f):
    print(restaurant(input().strip()))
