Problem: 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

Solution (in JAVA):

Solution:
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;

/* 
 * 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

extreme simple ring
Input 
1 10000000000
0
10000


 */
public class P702E_Analysis_of_Pathes_in_FunctionalGraph {
	private static BufferedReader br;
	private static PrintWriter pw;
	
	public static void main(String[] args) throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		pw = new PrintWriter(System.out);
		String[] splitted = br.readLine().split("\\s+");
		int n = Integer.parseInt(splitted[0]);
		long k = Long.parseLong(splitted[1]);
		int i, j;
		int nSparseBits = 34; //(int)(Math.log(1e10)/Math.log(2)) + 1;
		int[][] next = new int[n + 1][nSparseBits];
		int[][] w = new int[n + 1][nSparseBits];
		long[][] S = new long[n + 1][nSparseBits];

		splitted = br.readLine().split("\\s+");
		for (i = 1; i <= n; i++) {
			next[i][0] = Integer.parseInt(splitted[i - 1]) + 1;
		}
		splitted = br.readLine().split("\\s+");
		for (i = 1; i <= n; i++) {
			S[i][0] = w[i][0] = Integer.parseInt(splitted[i - 1]);
		}

		for (j = 1; j < nSparseBits; j++) {
			for (i = 1; i <= n; i++) {
				int p = next[i][j-1];
				next[i][j] = next[p][j-1];
				w[i][j] = Math.min(w[i][j-1], w[p][j-1]);
				S[i][j] = S[i][j-1] + S[p][j-1];
			}
		}
		
		for (i = 1; i <= n; i++) {
			long sumW = 0;
			int minW = Integer.MAX_VALUE;
			int p = i;

			for (j = nSparseBits - 1; j >= 0; j--) {
				if (((k >> j) & 1) != 0) {
					minW = Math.min(minW, w[p][j]);
					sumW += S[p][j];
					p = next[p][j];
				}
			}
			
			pw.printf("%d %d\n", sumW, minW);
		}
		
		pw.close();
	}
}