#include<bits/stdc++.h>
using namespace std;
int a,b,f,g = 0;
long long c[1000005],d[100005] = {'0'};
bool e = false;
int main(){
    cin>>a>>b;
    for(int i = 0;i<a;i++){
        cin>>c[i];
    }
    for(int i = 0;i<b;i++){
        cin>>d[i];
        for(int j = 0;j <a;j++){
            if(c[j] == d[i]){
                f = j + 1;
                e = true;
                break;
            }
        }
        if(e == false){
            cout<<-1;
        }
        else{
            cout<<f<<" ";
            e = false;
        }
    }
}

本人写了代码，样例过了，提交全是TLE和WA(虽然我知道这是暴力算法）[求解(ToT)/~~~]