#include<bits/stdc++.h> using namespace std; int a[100086]; int n,q,x; int f(int x){ int l=1,r=n,mid; while(l<=r){ mid=(l+r)/2; if(x<=a[mid]) r=mid-1; else l=mid+1; } if(a[l]==x) return l; else return -1; } int hsb(int m){ int l=1,r=n,mid; while(l<=r){ mid=(l+r)/2; if(m<a[mid]) r=mid-1; else l=mid+1; } if(a[r]==x) return r; else return -1; } int main(){ 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",f(x),hsb(x)); } return 0; }