#include<bits/stdc++.h>
#define IOS cin.tie(0),cout.tie(0),ios::sync_with_stdio(0)
#define ll long long
#define db double
#define pb push_back
#define eb emplace_back
#define MS(x,y) memset(x,y,sizeof x)
#define MC(x,y) memcpy(x,y,sizeof x)
#define PLL pair<ll,ll>
using namespace std;
namespace slow{
	char Buf[1<<23],*P1=Buf,*P2=Buf;
	#define getchar() (P1==P2&&(P2=(P1=Buf)+fread(Buf,1,1<<23,stdin),P1==P2)?EOF:*P1++)
	#define T template<typename type>
	#define Ts template<typename type,typename... args>
	T inline void read(type &x){
		x=0;bool f=false;char ch=getchar();
		while(ch<'0'||ch>'9') f|=ch=='-',ch=getchar();
		while(ch>='0'&&ch<='9') x=x*10+(ch^48),ch=getchar();
		if(f) x=-x;
	}
	T inline void write(type o){
//		if(o<'0' || o>'9') return (void)putchar('o');
	    if(o<0) putchar('-'),o=-o;
	    if(o>9) write(o/10);putchar(o%10+'0');
	}
	Ts inline void read(type &x,args&... y){read(x),read(y...);}
	Ts inline void write(type x,args... y){write(x),putchar(' '),write(y...);putchar('\n');}	
}using namespace slow;
const int N=5e5+5,M=5e5+5;
const ll INF=1ll<<60,mod=998244353;
int n,q,s;
int vis[N],deg[N],to[N],fa[N],f[N][20],id[N],cir[N],siz[N],dis[N],cid[N],cnt[N];
int find(int x){
	return fa[x]==x?x:fa[x]=find(fa[x]);
}
void dfs1(int u,int srt){
	vis[u]++;cnt[u]=srt;
	int v=to[u];
	if((vis[v]<2 && cnt[u]==cnt[v]) || !cnt[v]) dfs1(v,srt);
	fa[find(u)]=find(v);
}
void dfs2(int u,int fa){
	id[u]=id[fa]+1;cid[u]=f[u][0]=u;siz[cir[u]=s]++;
	int v=to[u];
	if(!id[v]) dfs2(v,u);
}
int dfs3(int u){
	if(vis[u]==2) return u;
	int v=to[u];
	cid[u]=dfs3(v);dis[u]=dis[v]+1;
	return cid[u];
}
int query(int u,int v){
	if(dis[u]<dis[v]) swap(u,v);
	for(int i=__lg(n);i>=0;i--){
		if(dis[f[u][i]]>=dis[v]) u=f[u][i];
	}
	if(u==v) return v;
	for(int i=__lg(n);i>=0;i--){
		if(f[u][i]^f[v][i]) u=f[u][i],v=f[v][i];
	}
	return f[u][0];
}
int main(){
	read(n,q);
	for(int i=1;i<=n;i++){
		read(to[i]),f[i][0]=to[i],deg[to[i]]++;
	}
	for(int i=1;i<=n;i++) fa[i]=i;
	for(int i=1;i<=n;i++) if(!deg[i]) dfs1(i,i);
	for(int i=1;i<=n;i++) if(!vis[i]) dfs1(i,i);
//	for(int i=1;i<=n;i++) cout<<vis[i]<<" ";cout<<"\n";
	for(int i=1;i<=n;i++){
		if(!id[i] && vis[i]==2) s++,dfs2(i,0);
	}
	for(int i=1;i<=n;i++) if(!deg[i]) dfs3(i);
	for(int j=1;j<=__lg(n);j++){
		for(int i=1;i<=n;i++) f[i][j]=f[f[i][j-1]][j-1];
	}
	for(int i=1,x,y;i<=q;i++){
		read(x,y);
		if(find(x)!=find(y)) write(-1,-1);
		else if(cid[x]==cid[y]){
			int lc=query(x,y);
			write(dis[x]-dis[lc],dis[y]-dis[lc]);
		}
		else{
			int xid=cid[x],yid=cid[y],xl=dis[x],yl=dis[y];
			int Siz=siz[cir[xid]];
			int nx=(id[yid]-id[xid]+Siz)%Siz,ny=(id[xid]-id[yid]+Siz)%Siz;
			if(max(xl,yl+ny)==max(xl+nx,yl)){
				if(min(xl,yl+ny)==min(xl+nx,yl)){
					if(xl>=yl+ny) write(xl,yl+ny);
					else write(xl+nx,yl);
				}
				else if(min(xl,yl+ny)<min(xl+nx,yl)) write(xl,yl+ny);
				else write(xl+nx,yl);
			}
			else if(max(xl,yl+ny)<max(xl+nx,yl)) write(xl,yl+ny);
			else write(xl+nx,yl);
		}
	}
	return 0;
}