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;
bool debug = 0;
int n, m, k;
int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0};
string direc = "RDLU";
long long ln, lk, lm;
void etp(bool f = 0) {
  puts(f ? "YES" : "NO");
  exit(0);
}
void addmod(int &x, int y, int mod = 1000000007) {
  x += y;
  if (x >= mod) x -= mod;
}
void et() {
  puts("-1");
  exit(0);
}
int f[100005], w[100005];
int pa[100005][35], mi[100005][35];
long long ss[100005][35];
void fmain() {
  scanf("%d%lld", &n, &lk);
  for (int(i) = 0; (i) < (int)(n); (i)++) scanf("%d", f + i);
  for (int(i) = 0; (i) < (int)(n); (i)++) scanf("%d", w + i);
  for (int(i) = 0; (i) < (int)(n); (i)++) {
    pa[i][0] = f[i];
    mi[i][0] = w[i];
    ss[i][0] = w[i];
  }
  for (int j = 1; j < 35; j++)
    for (int i = 0; i < n; i++) {
      pa[i][j] = pa[pa[i][j - 1]][j - 1];
      mi[i][j] = min(mi[i][j - 1], mi[pa[i][j - 1]][j - 1]);
      ss[i][j] = ss[i][j - 1] + ss[pa[i][j - 1]][j - 1];
    }
  for (int(i) = 0; (i) < (int)(n); (i)++) {
    int a = (1 << 30);
    long long b = 0, x = lk;
    int pos = i;
    for (int j = 34; j >= 0; j--) {
      if ((1LL << j) <= x) {
        x -= 1LL << j;
        a = min(a, mi[pos][j]);
        b += ss[pos][j];
        pos = pa[pos][j];
      }
    }
    printf("%lld %d\n", b, a);
  }
}
int main() {
  fmain();
  return 0;
}
