#include<bits/stdc++.h>
using namespace std;
const int MaxN=2e5;
int N, Q;
int num[MaxN];
int qry[MaxN];
int idx[MaxN];
int ans[MaxN];
bool comp(int lhs,int rhs){
return qry[lhs]>qry[rhs];
}
int main(){
cin>>N>>Q;
for(int n=0; n<N; n+=1)
cin>>num[n];
for(int q=0; q<Q; q+=1)
cin>>qry[q];
//
for(int q=0; q<Q; q+=1)
idx[q]=q;
sort(idx,idx+Q,comp);
for(int q=0; q<Q; q+=1)
cout<<idx[q]<<" "<<qry[idx[q]]<<" "<<ans[idx[q]]<<"\n";
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmNvbnN0IGludCBNYXhOPTJlNTsKaW50IE4sIFE7CmludCBudW1bTWF4Tl07CmludCBxcnlbTWF4Tl07CmludCBpZHhbTWF4Tl07CmludCBhbnNbTWF4Tl07Cgpib29sIGNvbXAoaW50IGxocyxpbnQgcmhzKXsKCXJldHVybiBxcnlbbGhzXT5xcnlbcmhzXTsKfQppbnQgbWFpbigpewoJY2luPj5OPj5ROwoJZm9yKGludCBuPTA7IG48Tjsgbis9MSkKCQljaW4+Pm51bVtuXTsKCWZvcihpbnQgcT0wOyBxPFE7IHErPTEpCgkJY2luPj5xcnlbcV07CgkvLwoJZm9yKGludCBxPTA7IHE8UTsgcSs9MSkKCQlpZHhbcV09cTsKCXNvcnQoaWR4LGlkeCtRLGNvbXApOwoJZm9yKGludCBxPTA7IHE8UTsgcSs9MSkKCQljb3V0PDxpZHhbcV08PCIgIjw8cXJ5W2lkeFtxXV08PCIgIjw8YW5zW2lkeFtxXV08PCJcbiI7Cn0=