#include <bits/stdc++.h>
const long long INF = 4e18L + 1;
const int IINF = 2e9 + 1;
const int limit = 1048576;
using namespace std;
const long long LOG = 35;
vector<vector<long long> > s_val, m_val, next_vert;
long long s, m;
void solve(long long v, long long len, long long scanned) {
  for (long long i = (long long)scanned; i < (long long)LOG; i++) {
    if (len & (1ll << i)) {
      if (0) cout << "i " << i << " len " << len << " s " << s << endl;
      s += s_val[v][i];
      m = min(m, m_val[v][i]);
      solve(next_vert[v][i], len, i + 1);
      return;
    }
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  long long n, k;
  cin >> n >> k;
  s_val.resize(n, vector<long long>(LOG)),
      m_val.resize(n, vector<long long>(LOG)),
      next_vert.resize(n, vector<long long>(LOG));
  for (auto& arr : next_vert) {
    cin >> arr[0];
  }
  for (auto& arr : s_val) {
    cin >> arr[0];
  }
  m_val = s_val;
  for (long long i = (long long)1; i < (long long)LOG; i++) {
    for (long long v = (long long)0; v < (long long)n; v++) {
      int w = next_vert[v][i - 1];
      next_vert[v][i] = next_vert[w][i - 1];
      s_val[v][i] = s_val[v][i - 1] + s_val[w][i - 1];
      m_val[v][i] = min(m_val[v][i - 1], m_val[w][i - 1]);
      if (0)
        cout << "v " << v << " i " << i << " s_val " << s_val[v][i] << endl;
    }
  }
  for (long long v = (long long)0; v < (long long)n; v++) {
    s = 0, m = INF;
    solve(v, k, 0);
    cout << s << " " << m << "\n";
  }
  return 0;
}
