#include #include #include #define LL long long #define Re register int using namespace std; const int N=1e6+5,logN=14; int o,n,m,x,y,t,T,A[N],Q[N],Ans[N],cnt[N],son[N],deep[N],size[N],head[N]; struct QAQ{int to,next;}a[N]; inline void add(Re x,Re y){a[++o].to=y,a[o].next=head[x],head[x]=o;} struct Query{ int o,head[N]; struct QAQ{int to,id,next;}a[N]; inline void add(Re x,Re y,Re id){a[++o].to=y,a[o].id=id,a[o].next=head[x],head[x]=o;} }QT; inline void in(Re &x){ int f=0;x=0;char c=getchar(); while(c<'0'||c>'9')f|=c=='-',c=getchar(); while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c^48),c=getchar(); x=f?-x:x; } struct LCA{ int ant[N][15]; inline void dfs(Re x,Re fa){ deep[x]=deep[ant[x][0]=fa]+1; for(Re i=1;(1<=0;--i) if((1<size[son[x]])son[x]=to; } } inline void CL(){ while(t)cnt[Q[t--]]=0; } inline void insert(Re x){ ++cnt[Q[++t]=deep[x]]; } inline void addson(Re x,Re fa){ insert(x); for(Re i=head[x],to;i;i=a[i].next) if((to=a[i].to)!=fa)addson(to,x); } inline void sakura(Re x,Re fa){ for(Re i=head[x],to;i;i=a[i].next) if((to=a[i].to)!=fa&&to!=son[x])sakura(to,x),CL(); if(son[x])sakura(son[x],x); for(Re i=head[x],to;i;i=a[i].next) if((to=a[i].to)!=fa&&to!=son[x])addson(to,x); insert(x); for(Re i=QT.head[x];i;i=QT.a[i].next) Ans[QT.a[i].id]=cnt[deep[x]+QT.a[i].to]; } int main(){ // freopen("123.txt","r",stdin); in(n),in(T); for(Re i=2;i<=n;++i)in(x),add(x,i); T1.dfs(1,0); for(Re i=1;i<=T;++i)in(x),in(y),QT.add(T1.kant(x,y),y,i); dfs(1,0),sakura(1,n); for(Re i=1;i<=T;++i)printf("%d ",max(Ans[i]-1,0)); }