#include <bits/stdc++.h>
using namespace std;
const int mod = 7 + 1e9;
const int inf = 1e9;
const int N = 1e5 + 5;
const int level = 40;
int in[N], w[N], to[N][level], _min[N][level];
long long sum[N][level];
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  long long k;
  cin >> n >> k;
  for (int i = 0; i < (n); i++) {
    cin >> in[i];
    to[i][0] = in[i];
  }
  for (int i = 0; i < (n); i++) {
    cin >> w[i];
    _min[i][0] = w[i];
    sum[i][0] = w[i];
  }
  for (int j = 1; j < (level); j++) {
    for (int i = 0; i < (n); i++) {
      to[i][j] = to[to[i][j - 1]][j - 1];
      _min[i][j] = min(_min[i][j - 1], _min[to[i][j - 1]][j - 1]);
      sum[i][j] = sum[i][j - 1] + sum[to[i][j - 1]][j - 1];
    }
  }
  for (int i = 0; i < (n); i++) {
    long long s = 0;
    int m = 1e9;
    int cur = i;
    long long cnt = k;
    for (long long j = 39; j >= 0; --j) {
      if ((1ll << j) <= cnt) {
        cnt -= (1ll << j);
        s += sum[cur][j];
        m = min(m, _min[cur][j]);
        cur = to[cur][j];
      }
    }
    cout << s << " " << m << "\n";
  }
}
