#include<algorithm>

#include<cstdio>

#include<cstring>

#include<iostream>

using namespace std;

typedef long long ll;

const int N=1e5+;

const int M=;

const int inf=1e9;

int n;

ll k;

int to[N][M],mi[N][M];

ll sum[N][M];

inline ll read()

{

    char ch=getchar();

    ll s=,f=;

    while (ch<''||ch>'') {if (ch=='-') f=-;ch=getchar();}

    while (ch>=''&&ch<='') {s=(s<<)+(s<<)+ch-'';ch=getchar();}

    return s*f;

}

int main()

{

    n=read();k=read();

    for (int i=;i<n;i++) to[i][]=read();

    for (int i=;i<n;i++) {sum[i][]=read();mi[i][]=sum[i][];}

    for (int i=;i<M;i++)

    {

        for (int j=;j<n;j++) to[j][i]=to[to[j][i-]][i-];

        for (int j=;j<n;j++)

        {

            sum[j][i]=sum[j][i-]+sum[to[j][i-]][i-];

            mi[j][i]=min(mi[j][i-],mi[to[j][i-]][i-]);

        }

    }

    for (int i=;i<n;i++)

    {

        ll s=,kk=k;

        int m=inf,p=i;

        for (int j=M-;j>=;j--)

        {

            if (!kk) break;

            if ((1ll<<j)<=kk)

            {

                kk-=1ll<<j;

                s+=sum[p][j];

                m=min(m,mi[p][j]);

                p=to[p][j];

            }

        }

        printf("%lld %d\n",s,m);

    }

    return ;

}