#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
const int K = 40;
int n;
long long k;
int nx[K][N];
long long sum[K][N];
int mn[K][N];
int a[N];
int go[50], len = 0;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> k;
  for (int i = 0; i < n; ++i) cin >> nx[0][i];
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 0; i < n; ++i) sum[0][i] = mn[0][i] = a[i];
  for (int step = 1; step <= 35; ++step) {
    for (int i = 0; i < n; ++i) {
      nx[step][i] = nx[step - 1][nx[step - 1][i]];
      sum[step][i] = sum[step - 1][nx[step - 1][i]] + sum[step - 1][i];
      mn[step][i] = min(mn[step - 1][nx[step - 1][i]], mn[step - 1][i]);
    }
  }
  for (int jump = 35; jump >= 0; --jump) {
    if ((1ll << jump) <= k) {
      k -= (1ll << jump);
      go[++len] = jump;
    }
  }
  for (int i = 0; i < n; ++i) {
    long long s = 0;
    int m = 1000000000;
    int v = i;
    for (int it = 1; it <= len; ++it) {
      s += sum[go[it]][v];
      m = min(m, mn[go[it]][v]);
      v = nx[go[it]][v];
    }
    cout << s << " " << m << endl;
  }
  return 0;
}
