2890. 询问队员身高

text=int(input())
for i in range(text):
    n,m=map(int,input().split())
    a=list(map(int,input().split()))
    b = list(map(int, input().split()))
    c=sorted(a,reverse=True)
    d=[]
    e=[]
    for i in b:
        d.append(c[i-1])
    for i in d:
        e.append(a.index(i)+1)
    x=" ".join(str(i) for i in e)
    print(x)

#include <iostream>
#include <algorithm>
using namespace std;

struct member {
    int num;
    int height;
};

bool cmp(const member& a, const member& b)
{
    return (a.height > b.height);
}

void solve()
{
    int memberNum, askNum;
    cin >> memberNum >> askNum;
    member* data = new member[memberNum];
    for (int i = 0; i < memberNum; i++) {
        int temp; cin >> temp;
        data[i].num = i + 1; data[i].height = temp;
    }
    sort(data, data + memberNum, cmp);
    int* ask = new int[askNum];
    for (int i = 0; i < askNum; i++) {
        int temp; cin >> temp;
        ask[i] = temp;
    }
    for (int i = 0; i < askNum; i++) {
        cout << data[ask[i] - 1].num << ((i + 1 == askNum) ? "\n" : " ");
    }
}