#include<bits/stdc++.h> 
using namespace std;
int a[100010]={0};
int b[100010]={0};
int main()
{
    freopen("pathsjump.in","r",stdin);
    freopen("pathsjump.out","w",stdout);
    long long n,k,ans1,ans2,c,i,j;
    cin>>n>>k;
    for(i=1;i<=n;i++)
    {
		cin>>a[i];
	}
	for(i=1;i<=n;i++)
	{
		cin>>b[i];
	}
	for(i=1;i<=n;i++)
	{
		c=i;ans1=0;ans2=b[c];
		for(j=1;j<=k;j++)
		{
			ans1=ans1+b[c];
			if(b[c]<ans2)
			{
				ans2=b[c];
			}
			c=a[c];
		}
		cout<<ans1<<" "<<ans2<<endl;
	}
    return 0;
}