#include<bits/stdc++.h>
using namespace std;
const int N = 5e5 + 10;int head[N], now;
struct edges{int to, next, w;
}edge[N<<1];
void add(int u, int v, int w){ edge[++now] = {v, head[u], w}; head[u] = now;}
void read(int &x){int f=1;x=0;char s=getchar();while(s<'0'||s>'9'){if(s=='-')f=-1;s=getchar();}while(s>='0'&&s<='9'){x=x*10+s-'0';s=getchar();}x*=f;
}int n, q, dfn[N], sz, pre[N], tot, c[N], dict[N], bel[N], fa[N][22], dep[N], pos[N];
vector<int> cir[N];
void fcur(int x){dfn[x] = ++sz; bel[x] = tot;for(int i = head[x]; i; i = edge[i].next){int v = edge[i].to;if(v == pre[x]) continue;if(dfn[v]){if(dfn[v] < dfn[x]) continue;cir[tot].push_back(x); c[x] = tot;for(; x != v; v = pre[v]){cir[tot].push_back(v), c[v] = tot;}}else pre[v] = x, fcur(v);}return ;
}void dfs(int x, int father, int root){dict[x] = root; fa[x][0] = father;for(int i = head[x]; i; i = edge[i].next){int v = edge[i].to;if(v == father || c[v]) continue;dep[v] = dep[x] + 1;dfs(v, x, root);}
}
int LCA(int u,int v){if(dep[u]<dep[v]) swap(u,v);int k=dep[u]-dep[v];for(int i=0;i<=20;i++)if((1<<i)&k) u=fa[u][i];if(u==v) return u;for(int i=20;i>=0;i--)if(fa[u][i]!=fa[v][i])u=fa[u][i],v=fa[v][i];return fa[u][0];
}
void dfs2(int x, int step){pos[x] = step;for(int i = head[x]; i; i = edge[i].next){int v = edge[i].to;if(edge[i].w && !pos[v]) dfs2(v, step + 1);}
}
int main(){read(n), read(q);int x, y;for(int i = 1; i <= n; i++){read(x);add(i, x, 1), add(x, i, 0);}for(int i = 1; i <= n; i++){if(!dfn[i]){sz = 0;  tot++;fcur(i);}}for(int i = 1; i <= tot; i++){dfs2(cir[i][0], 1);for(int j = 0; j < cir[i].size(); j++){x = cir[i][j];dict[x] = x;dfs(x, x, x);}}for(int j = 0; j <= 20; j++)for(int i = 1; i <= n; i++)fa[i][j + 1] = fa[fa[i][j]][j];while(q--){scanf("%d%d", &x, &y);if(bel[x] != bel[y]){puts("-1 -1");  continue;}else if(dict[x] == dict[y]){int lca = LCA(x, y);printf("%d %d\n", dep[x] - dep[lca], dep[y] - dep[lca]);}else{int rt1 = dict[x], rt2 = dict[y], siz = cir[bel[x]].size();int s1 = dep[x] - dep[rt1], s2 = dep[y] - dep[rt2];int k1, k2;if(pos[rt1] < pos[rt2])  k1 = pos[rt2] - pos[rt1], k2 = siz - k1;else k2 = pos[rt1] - pos[rt2], k1 = siz - k2;int tmp1 = s1 + k1, tmp2 = s2 + k2;if(max(tmp1, s2) != max(s1, tmp2)){if(max(tmp1, s2) > max(s1, tmp2)) printf("%d %d\n", s1, tmp2);else printf("%d %d\n", tmp1, s2);continue;}else if(min(tmp1, s2) != min(s1, tmp2)){if(min(tmp1, s2) > min(s1, tmp2)) printf("%d %d\n", s1, tmp2);else printf("%d %d\n", tmp1, s2);continue;}else{if(tmp1 >= s2) printf("%d %d\n", tmp1, s2);else printf("%d %d\n", s1, tmp2);}}}return 0;
}