#include<iostream>
#include<cstdio>
#include<vector>
#include<algorithm>
#define N 300000
#define M 600000
#define W 1048576
using namespace std;
const int inf=(int)(1e9);
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
struct rds
{
	int num,data,snum;
	bool operator < (const rds &t)const
	{
		return data<t.data;
	}
};
rds st[N+1];
int n,m,C,limit,srt,leng,wp[N+1],rk[N+1],depth[N+1],smz,sz[N+1],szt[N+1],dis[N+1],maxp[N+1],ans[M+1],sl[N+1],sr[N+1],delta[N+1];
vector<int>E[N+1];
vector<rds>v[N+1];
vector<rds>p[N+1];
bool used[N+1],vis[N+1];
bool cmp(int x,int y)
{
	return depth[x]<depth[y];
}
void add_edge(int x,int y)
{
	E[x].push_back(y),E[y].push_back(x);
	return;
}
void dfs(int x)
{
	used[x]=1;
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]])
			depth[E[x][i]]=depth[x]+1,dfs(E[x][i]);
	return;
}
void get_rt(int x)
{
	sz[x]=vis[x]=1,maxp[x]=0;
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]]&&!vis[E[x][i]])
			get_rt(E[x][i]),sz[x]+=sz[E[x][i]],maxp[x]=max(maxp[x],sz[E[x][i]]);
	maxp[x]=max(maxp[x],smz-sz[x]),vis[x]=0;
	if (maxp[x]<maxp[srt]) srt=x;
	return;
}
void dfs2(int x)
{
	st[++leng]=(rds){x,dis[x]},vis[x]=szt[x]=1;
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]]&&!vis[E[x][i]])
			dis[E[x][i]]=dis[x]+1,dfs2(E[x][i]),szt[x]+=szt[E[x][i]];
	vis[x]=0;
	return;
}
struct seg
{
	int wl[W+1],wr[W+1],num[W+1],snum[W+1],minn[W+1];
	void build(int k,int l,int r)
	{
		wl[k]=l,wr[k]=r,snum[k]=0,minn[k]=inf;
		if (l==r)
		{
			num[l]=k,snum[k]=l;
			return;
		}
		int mid=(l+r)>>1;
		build(k<<1,l,mid),build(k<<1|1,mid+1,r);
		return;
	}
	void push_up(int k)
	{
		minn[k]=min(minn[k<<1],minn[k<<1|1]);
		return;
	}
	void change(int x,int d)
	{
		x=num[x],minn[x]=d;
		while (x!=1) x>>=1,push_up(x);
		return;
	}
	int find(int x,int d)
	{
		if (minn[1]>=d) return -1;
		int k=-1;
		x=num[x];
		while (x!=1)
		{
			if (x&1)
			{
				if (minn[x^1]<d)
				{
					k=x^1;
					break;
				}
			}
			x>>=1;
		}
		if (k==-1) return -1;
		while (!snum[k])
		{
			if (minn[k<<1|1]<d) k=k<<1|1;
			else k<<=1;
		}
		return snum[k];
	}
	int find2(int x,int d)
	{
		if (minn[1]>=d) return -1;
		int k=-1;
		x=num[x];
		while (x!=1)
		{
			if (!(x&1))
			{
				if (minn[x^1]<d)
				{
					k=x^1;
					break;
				}
			}
			x>>=1;
		}
		if (k==-1) return -1;
		while (!snum[k])
		{
			if (minn[k<<1]<d) k<<=1;
			else k=k<<1|1;
		}
		return snum[k];
	}
};
seg T;
bool cmp2(rds x,rds y)
{
	return x.num<y.num;
}
void solve(int x)
{
	int d,ps=0;
	leng=0,used[x]=1,dis[x]=0,dfs2(x),sort(st+1,st+leng+1,cmp2);
	for (int i=1;i<=leng;++i) st[i].snum=i,delta[i]=st[i].num;
	sort(st+1,st+leng+1),limit=1;
	while (limit<leng) limit<<=1;
	T.build(1,1,limit);
	for (int i=leng;i>=1;--i)
	{
		while (ps+1<=leng&&st[ps+1].data+st[i].data<=C) ++ps,T.change(st[ps].snum,rk[st[ps].num]);
		if (ps)
		{
			d=T.find(st[i].snum,rk[st[i].num]);
			if (d!=-1) sl[st[i].num]=max(sl[st[i].num],delta[d]);
			d=T.find2(st[i].snum,rk[st[i].num]);
			if (d!=-1) sr[st[i].num]=min(sr[st[i].num],delta[d]);
		}
	}
	for (int i=0;i<E[x].size();++i)
		if (!used[E[x][i]])
			srt=0,smz=szt[E[x][i]],get_rt(E[x][i]),solve(srt);
	return;
}
int c[N+1];
int lowbit(int x)
{
	return x&(-x);
}
void add(int x,int d)
{
	x=n-x+1;
	for (;x<=n;x+=lowbit(x)) c[x]+=d;
	return;
}
int query(int x)
{
	x=n-x+1;
	int res=0;
	for (;x>=1;x-=lowbit(x)) res+=c[x];
	return res;
}
int main()
{
	int l,r,x;
	n=read(),m=read(),C=read(),maxp[0]=inf;
	for (int i=2;i<=n;++i) x=read(),add_edge(x,i);
	depth[1]=1,dfs(1);
	for (int i=1;i<=n;++i) wp[i]=i,sl[i]=-inf,sr[i]=inf,used[i]=0;
	sort(wp+1,wp+n+1,cmp);
	for (int i=1;i<=n;++i) rk[wp[i]]=i;
	srt=0,smz=n,get_rt(1),solve(srt);
	for (int i=1;i<=m;++i) l=read(),r=read(),v[r].push_back((rds){i,l});
	for (int i=1;i<=n;++i)
	{
		if (sl[i]!=-inf) p[i].push_back((rds){sl[i],1});
		if (sr[i]!=inf) p[sr[i]].push_back((rds){i,1});
		if (sl[i]!=-inf&&sr[i]!=inf) p[sr[i]].push_back((rds){sl[i],-1});
	}
	for (int i=1;i<=n;++i)
	{
		for (int j=0;j<p[i].size();++j) add(p[i][j].num,p[i][j].data);
		for (int j=0;j<v[i].size();++j) ans[v[i][j].num]=i-v[i][j].data+1-query(v[i][j].data);
	}
	for (int i=1;i<=m;++i) printf("%d\n",ans[i]);
	return 0;
}