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

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class E {
	
	long k;
	int n, f[][];
	long w[];
	long s[][], m[][];

	final int dep = 35;
	
	public void solve(InputReader in, PrintWriter out) {
		n = in.nextInt();
		k = in.nextLong();
		f = new int[n][dep];
		w = new long[n];
		
		for(int i = 0; i < f.length; i++) f[i][0] = in.nextInt();
	    for(int i = 0; i < w.length; i++) w[i] = in.nextLong();
	        
		s = new long[n][dep];
		m = new long[n][dep];
		
		for(int i = 0; i < n; i++) s[i][0] = m[i][0] = w[i];
		
		for(int p = 1; p < dep; p++) {
			for(int i = 0; i < n; i++) {
				f[i][p] = f[f[i][p-1]][p-1];
				s[i][p] = s[i][p-1] + s[f[i][p-1]][p-1];
				m[i][p] = Math.min(m[i][p-1], m[f[i][p-1]][p-1]);
			}
		}
		
		for(int i = 0; i < n; i++) {
			long sum, min;
			sum = 0; 
			min = Long.MAX_VALUE;
			
			int vert = i;
			for(int j = 0; j < dep && (k >> j) > 0; j++) {
				if( (k & (1L << j)) != 0) {
					sum += s[vert][j];
					min = Math.min(min, m[vert][j]);
					
					vert = f[vert][j];
				}
			}
				
			System.out.println(sum + " " + min);
		}
		
	}

	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		InputReader in = new InputReader(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		E solver = new E();
		solver.solve(in, out);
		out.close();
	}

	static class InputReader {
		public BufferedReader reader;
		public StringTokenizer tokenizer;

		public InputReader(InputStream stream) {
			reader = new BufferedReader(new InputStreamReader(stream), 32768);
			tokenizer = null;
		}

		public String next() {
			while (tokenizer == null || !tokenizer.hasMoreTokens()) {
				try {
					tokenizer = new StringTokenizer(reader.readLine());
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return tokenizer.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

		public long nextLong() {
			return Long.parseLong(next());
		}

		public double nextDouble() {
			return Double.parseDouble(next());
		}
	}
}
