You are given a functional graph. It is a directed graph, in which from each vertex goes exactly one arc. The vertices are numerated from 0 to n - 1.

Graph is given as the array f0, f1, ..., fn - 1, where fi — the number of vertex to which goes the only arc from the vertex i. Besides you are given array with weights of the arcs w0, w1, ..., wn - 1, where wi — the arc weight from i to fi.

<image> The graph from the first sample test.

Also you are given the integer k (the length of the path) and you need to find for each vertex two numbers si and mi, where:

  * si — the sum of the weights of all arcs of the path with length equals to k which starts from the vertex i; 
  * mi — the minimal weight from all arcs on the path with length k which starts from the vertex i. 



The length of the path is the number of arcs on this path.

Input

The first line contains two integers n, k (1 ≤ n ≤ 105, 1 ≤ k ≤ 1010). The second line contains the sequence f0, f1, ..., fn - 1 (0 ≤ fi < n) and the third — the sequence w0, w1, ..., wn - 1 (0 ≤ wi ≤ 108).

Output

Print n lines, the pair of integers si, mi in each line.

Examples

Input

7 3
1 2 3 4 3 2 6
6 3 1 4 2 2 3


Output

10 1
8 1
7 1
10 2
8 2
7 1
9 3


Input

4 4
0 1 2 3
0 1 2 3


Output

0 0
4 1
8 2
12 3


Input

5 3
1 2 3 4 0
4 1 2 14 3


Output

7 1
17 1
19 2
21 3
8 1
#include <bits/stdc++.h>
using namespace std;
const long long maxk = 36;
long long n, k, i, j, f, w, curk, s, m, curi, maxik;
pair<int, pair<long long, long long> > otv[100010][maxk], cur1, cur2;
long long inf = 1000000007;
long long min(long long a, long long b) {
  if (a < b)
    return a;
  else
    return b;
}
int main() {
  scanf("%I64d %I64d", &n, &k);
  for (i = 0; i < n; i++) {
    scanf("%I64d", &f);
    otv[i][0].first = f;
  }
  for (i = 0; i < n; i++) {
    scanf("%I64d", &w);
    otv[i][0].second = make_pair((w), (w));
  }
  maxik = 0;
  curk = k;
  while (curk > 0) {
    maxik++;
    curk = curk >> 1;
  }
  maxik = maxik + 1;
  for (j = 1; j < maxik; j++)
    for (i = 0; i < n; i++) {
      cur1 = otv[i][j - 1];
      cur2 = otv[cur1.first][j - 1];
      otv[i][j].second.first = cur1.second.first + cur2.second.first;
      otv[i][j].second.second = min(cur1.second.second, cur2.second.second);
      otv[i][j].first = cur2.first;
    }
  for (i = 0; i < n; i++) {
    curi = i;
    curk = k;
    s = 0;
    m = inf;
    for (j = maxik - 1; j >= 0; j--) {
      if (curk <= 0) break;
      if (curk < (1ll << j)) continue;
      s += otv[curi][j].second.first;
      m = min(m, otv[curi][j].second.second);
      curi = otv[curi][j].first;
      curk = (curk - (1ll << j));
    }
    printf("%I64d %I64d\n", s, m);
  }
  return 0;
}
