#include<bits/stdc++.h> using namespace std; int n,a[100086],q,y; int d(int x){ int l=1,r=n,m; while(l<=r){ m=l+r>>1; if(x<=a[m]) r=m-1; else l=m+1; } if(a[l]==x) return l; else return -1; } int e(int x){ int l=1,r=n,m; while(l<=r){ m=(l+r)>>1; if(x<a[m]) r=m-1; else l=m+1; } if(x==a[r]) return r; else return -1; } int main(){ cin>>n; cin>>q; for(int i=1;i<=n;i++){ scanf("%d",&a[i]); } while(q--){ scanf("%d",&y); d(y); e(y); cout<<d(y)<<" "<<e(y); cout<<endl; } return 0; }