#include <bits/stdc++.h>
using namespace std;
const long long oo = 1e18 + 7, mod = 1e9 + 7;
const long long N = 1e5 + 5;
struct node {
  long long end, mx, tol;
} sparse[100005][34];
long long n, k, nxt[N], dist_loop[N], loop[N], lst[N], w[N];
bool vis[N];
signed main() {
  ios_base::sync_with_stdio(0);
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) {
    cin >> nxt[i];
    ++nxt[i];
  }
  for (long long i = 1; i <= n; i++) cin >> w[i];
  for (long long i = 1; i <= n; i++) {
    sparse[i][0].end = nxt[i];
    sparse[i][0].mx = w[i];
    sparse[i][0].tol = w[i];
  }
  for (long long i = 1; i <= 33; i++) {
    for (long long j = 1; j <= n; j++) {
      sparse[j][i].end = sparse[sparse[j][i - 1].end][i - 1].end;
      sparse[j][i].mx =
          min(sparse[j][i - 1].mx, sparse[sparse[j][i - 1].end][i - 1].mx);
      sparse[j][i].tol =
          sparse[j][i - 1].tol + sparse[sparse[j][i - 1].end][i - 1].tol;
    }
  }
  for (long long i = 1; i <= n; i++) {
    node ans;
    ans.end = i;
    ans.tol = 0;
    ans.mx = oo;
    for (long long j = 33; j >= 0; j--) {
      if (k & (1LL << j)) {
        ans.mx = min(ans.mx, sparse[ans.end][j].mx);
        ans.tol += sparse[ans.end][j].tol;
        ans.end = sparse[ans.end][j].end;
      }
    }
    cout << ans.tol << " " << ans.mx << "\n";
  }
}
