#include <iostream>

#include <vector>

#include <cstdio>

#include <cstring>

#include <algorithm>

#include <complex>

#include <cmath>

#include <map>

#include <set>

#include <string>

#include <queue>

#include <stack>

#include <bitset>

using namespace std;

#define pb(x) push_back(x)

#define ll long long

#define mk(x, y) make_pair(x, y)

#define lson l, m, rt<<1

#define mem(a) memset(a, 0, sizeof(a))

#define rson m+1, r, rt<<1|1

#define mem1(a) memset(a, -1, sizeof(a))

#define mem2(a) memset(a, 0x3f, sizeof(a))

#define rep(i, n, a) for(int i = a; i<n; i++)

#define fi first

#define se second

typedef complex <double> cmx;

typedef pair<int, int> pll;

const double PI = acos(-1.0);

const double eps = 1e-;

const int mod = 1e9+;

const int inf = ;

const int dir[][] = { {-, }, {, }, {, -}, {, } };

int nxt[][], mn[][];

ll sum[][];

int main()

{

    int n;

    ll k;

    cin>>n>>k;

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

        scanf("%d", &nxt[i][]);

    }

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

        scanf("%d", &mn[i][]);

        sum[i][] = mn[i][];

    }

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

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

            nxt[j][i] = nxt[nxt[j][i-]][i-];

            mn[j][i] = min(mn[j][i-], mn[nxt[j][i-]][i-]);

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

        }

    }

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

        ll ansSum = , tmpk = k;

        int ansMin = inf, pos = j;

        for(int i = ; i >= ; i--) {

            ll tmp = 1LL<<i;

            if(tmpk >= tmp) {

                tmpk -= tmp;

                ansSum += sum[pos][i];

                ansMin = min(ansMin, mn[pos][i]);

                pos = nxt[pos][i];

            }

        }

        printf("%I64d %d\n", ansSum, ansMin);

    }

    return ;

}