#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N=1e5+5;
int n,k,v[N],val[N];
signed main(){
	freopen("pathsjump.in","r",stdin);
	freopen("pathsjump.out","w",stdout);
    scanf("%lld%lld",&n,&k);
    for(int i = 0;i<n;i++) scanf("%lld",&v[i]);
    for(int i = 0;i<n;i++) scanf("%lld",&val[i]);
    for(int i = 0;i<n;i++){
        int sum=0,ans=0x3f3f3f3f,pos=i;
        for(int j=0;j<k;j++){
            sum+=val[pos];
            if(val[pos]<ans) ans=val[pos];
            pos=v[pos];
        }
        printf("%lld %lld\n",sum,ans);
    }
    return 0;
}