?

?

?

#include
         
          
#include
          
            #include
           
             #include
            
              #include
             
               #include
              
                using namespace std; char str[1000001]; int main() { while(gets(str)!=NULL) { int len = strlen(str); for(int i=0;i
               
                ");break; case 'R':printf("P");break; case 'T':printf("Y");break; case 'Y':printf("F");break; case 'U':printf("G");break; case 'I':printf("C");break; case 'a':printf("a");break; case 'S':printf("O");break; case 's':printf("o");break; case 'D':printf("E");break; case 'F':printf("U");break; case 'G':printf("I");break; case 'H':printf("D");break; case 'O':printf("R");break; case 'P':printf("L");break; case 'A':printf("A");break; case 'J':printf("H");break; case 'K':printf("T");break; case 'L':printf("N");break; case 'd':printf("e");break; case 'f':printf("u");break; case 'g':printf("i");break; case 'h':printf("d");break; case 'j':printf("h");break; case 'k':printf("t");break; case 'l':printf("n");break; case ':':printf("S");break; case ';':printf("s");break; case '"':printf("_");break; case '\'':printf("-");break; case 'Z':printf(":");break; case 'X':printf("Q");break; case 'C':printf("J");break; case 'V':printf("K");break; case 'B':printf("X");break; case 'N':printf("B");break; case 'M':printf("M");break; case 'z':printf(";");break; case 'x':printf("q");break; case 'c':printf("j");break; case 'v':printf("k");break; case 'b':printf("x");break; case 'n':printf("b");break; case 'm':printf("m");break; case '<':printf("W");break; case '>':printf("V");break; case ',':printf("w");break; case '.':printf("v");break; case '?':printf("Z");break; case '/':printf("z");break; case ' ':printf(" ");break; default : printf("%c",str[i]); } }printf("\n"); } return 0; } 
               
              
             
            
           
          
         

?

?

?

?

?

?

There is a popular multiplayer online battle arena game called Demacia of the Ancients. There are lots of professional teams playing this game. A team will be approved as Level K if there are exact K team members whose match making ranking (MMR) is strictly greater than 6000.

You are given a list of teams. Please calculate the level of each team.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

The first line contains an integer N (1 <= N <= 10) indicating the number of team members.

The second line contains N integers representing the MMR of each team member. All MMRs are non-negative integers less than or equal to 9999.

Output

For each test case, output the level of the given team.

Sample Input

3
5
7986 6984 6645 6200 6150
5
7401 7377 6900 6000 4300
3
800 600 200

Sample Output

5
3
0

?

?

#include 
         
          
#include 
          
            using namespace std; int main() { int T; scanf("%d",&T); while(T--) { int a[1001]; int n; scanf("%d",&n); for(int i=0;i
           
            6000) ans++; printf("%d\n",ans); } return 0; }
           
          
         

Edward has an array A with N integers. He defines the beauty of an array as the summation of all distinct integers in the array. Now Edward wants to know the summation of the beauty of all contiguous subarray of the array A.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case: