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.
t=int(input())
while t>0:
    a,b,k=input().split()
    d=int(a)
    c=int(b)
    p=int(k)
    max1=0
    if(d==0 and k==0 and p==0):
        max1=0
    elif((d>=1 and p==0 and c==0) or (d==0 and p>=1 and c==0) or (d==0 and p==0 and c>=1)):
        max1=1
    elif((d==0 and p==1 and c>=1) or (d==1 and p==0 and c>=1) or (d==1 and p>=1 and c==0)  or (d==0 and p>=1 and c==1) or (d>=1 and p==1 and c==0) or (d>=1 and p==0 and c==1)):
        max1=2
    elif((d==1 and p==1 and c>=1) or (d==1 and c==1 and p>=1) or (c==1 and p==1 and d>=1) or (d==0 and p>=2 and c>=2) or (p==0 and d>=2 and c>=2) or (c==0 and p>=2 and d>=2)):
        max1=3
    elif((d==1 and p>=2 and c>=2) or (p==1 and d>=2 and c>=2) or (c==1 and p>=2 and d>=2) or(d==2 and p==2 and c==2)):
        max1=4
    elif((d==2 and p==2 and c>=3) or (c==2 and p==2 and d>=3) or (d==2 and c==2 and p>=3) or (d>=3 and p>=3 and c==2) or (d>=3 and c>=3 and p==2) or  (c>=3 and p>=3 and d==2)  ):
        max1=5
    elif ((d==3 and p>=3 and c>=3) or (p==3 and d>=3 and c>=3) or (c==3 and p>=3 and d>=3)):
        max1=6
    elif((d>=4 and p>=4 and c>=4)):
        max1=7
    print(max1)
    t=t-1