#include<bits/stdc++.h> using namespace std; int a[100010]; int n,q,x; int findz(int x){ int l=1,r=n,mid; while(l<=r){ mid=l+r>>1; if(x<=a[mid]) r=mid-1; else l=mid+1; } if(a[l]==x) return l; else return -1; } int findy(int x){ int l=1,r=n,mid; while(l<=r){ mid=l+r>>1; if(x<a[mid]) r=mid-1; else l=mid+1; } if(a[r]==x) return r; else return -1; } int main(){ int s=0; scanf("%d %d",&n,&q); for(int i=1;i<=n;i++){ scanf("%d",&a[i]); } for(int i=1;i<=q;i++){ scanf("%d",&x); printf("%d %d\n",findz(x),findy(x)); } return 0; }