#include <bits/stdc++.h>
using namespace std;
const long long int INF = 10000000000000;
const int MAXN = 100010;
const int MAXLOG = 50;
long long int par[MAXN][MAXLOG];
long long int ans[MAXN][MAXLOG];
long long int mini[MAXN][MAXLOG];
pair<long long int, long long int> solve(long long int a, long long int b) {
  long long int ret1 = 0, ret2 = INF;
  long long int now = a;
  vector<long long int> bini;
  while (b != 0) {
    bini.push_back(b % 2);
    b /= 2;
  }
  while (bini.size() != MAXLOG) bini.push_back(0);
  for (int j = MAXLOG - 1; j >= 0; j--) {
    if (bini[j] == 1) {
      ret1 += ans[now][j];
      ret2 = min(ret2, mini[now][j]);
      now = par[now][j];
    }
  }
  return make_pair(ret1, ret2);
}
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  ios::sync_with_stdio(0);
  cout.tie(0);
  long long int n, k;
  cin >> n >> k;
  for (int j = 0; j < MAXLOG; j++) {
    for (int i = 0; i < n; i++) {
      mini[i][j] = INF;
    }
  }
  for (int i = 0; i < n; i++) {
    cin >> par[i][0];
  }
  for (int i = 0; i < n; i++) {
    cin >> ans[i][0];
    mini[i][0] = ans[i][0];
  }
  for (int j = 1; j < MAXLOG; j++) {
    for (int i = 0; i < n; i++) {
      par[i][j] = par[par[i][j - 1]][j - 1];
    }
  }
  for (int j = 1; j < MAXLOG; j++) {
    for (int i = 0; i < n; i++) {
      ans[i][j] = ans[i][j - 1] + ans[par[i][j - 1]][j - 1];
    }
  }
  for (int j = 1; j < MAXLOG; j++) {
    for (int i = 0; i < n; i++) {
      mini[i][j] = min(mini[i][j - 1], mini[par[i][j - 1]][j - 1]);
    }
  }
  for (int i = 0; i < n; i++) {
    pair<long long int, long long int> answer = solve(i, k);
    cout << answer.first << ' ' << answer.second << endl;
  }
}
