Codeforces Round #622 (Div. 2) 1313 A

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

inputCopy

7

1 2 1

0 0 0

9 1 7

2 2 3

2 3 2

3 2 2

4 4 4

outputCopy

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.

3种水果最多能凑出几种来，每种同一种水果只能使用一次，也就是最多能凑出7来。无非就一样一个，任意两个，三个的这三种情况，比如有一种非常多，这里就让它先组成，比如2 2 3,

每样一个，组成3种后还有1 1 2，1/ 3, 2/3 能组成2个，1/2 的话就不行了，就这一个小细节。

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int t;
    cin >> t;
    for (int i = 0; i < t; i++)
    {
        int a, b, c;
        cin >> a >> b >> c;
        if (a == 1)
            cout << 1 <<" "<<1<< endl;
        else{
            cout << max(1, min(a, b + c - a + 1)) << " ";
        if (b + c - 1 >a)
            cout << a << endl;
        else
            cout << min(a, a - (abs(a - b + 1 - c))) << endl;
        }
    }
}