A football team has 23 players, and each player has an integer comprehensive quality value. We sort and number the players according to their comprehensive quality value from large to small. That is, the largest comprehensive quality value is No. 1, followed by No. 2, and the smallest comprehensive quality value is No. 23.
When comparing the comprehensive strength of two teams, we compare them according to the players with the same number. If there are many players of a team whose comprehensive quality value is large in pairwise comparison, we think that this team has strong strength and will win the game.
Given two teams, which team is strong?
The first line is a positive integer T(1<=T<=100) ,indicating that there are T test data.
Next, input T testdata, each test data accounts for 2 lines, and each line has 23 positive integers, which respectively represent the comprehensive quality value V(1 <= V <= 100) of 23 players of a team.
Each test dataoutputs a line, which is the number of the strong team (numbered as 1 and 2respectively according to the order in which the teams appear).