巅峰赛1答案

#include <iostream>
#include <string>
#include <vector>

using namespace std;

void solve() {
int n;
string p;

if (!(cin >> n >> p)) return;

int rank = -1;
string s;

for (int i = 1; i <= n; ++i) {
    cin >> s;
    
    if (s == p && rank == -1) {
        rank = i; 
    }
}


cout << rank << endl;

}

int main() {

ios::sync_with_stdio(false);
cin.tie(0);

int t;
if (cin >> t) {
    while (t--) {
        solve();
    }
}
return 0;

}