Problem: On a strip of land of length n there are k air conditioners: the i-th air conditioner is placed in cell a_i (1 ≤ a_i ≤ n). Two or more air conditioners cannot be placed in the same cell (i.e. all a_i are distinct).

Each air conditioner is characterized by one parameter: temperature. The i-th air conditioner is set to the temperature t_i.

<image> Example of strip of length n=6, where k=2, a=[2,5] and t=[14,16].

For each cell i (1 ≤ i ≤ n) find it's temperature, that can be calculated by the formula $$$min_{1 ≤ j ≤ k}(t_j + |a_j - i|),$$$

where |a_j - i| denotes absolute value of the difference a_j - i.

In other words, the temperature in cell i is equal to the minimum among the temperatures of air conditioners, increased by the distance from it to the cell i.

Let's look at an example. Consider that n=6, k=2, the first air conditioner is placed in cell a_1=2 and is set to the temperature t_1=14 and the second air conditioner is placed in cell a_2=5 and is set to the temperature t_2=16. In that case temperatures in cells are:

  1. temperature in cell 1 is: min(14 + |2 - 1|, 16 + |5 - 1|)=min(14 + 1, 16 + 4)=min(15, 20)=15; 
  2. temperature in cell 2 is: min(14 + |2 - 2|, 16 + |5 - 2|)=min(14 + 0, 16 + 3)=min(14, 19)=14; 
  3. temperature in cell 3 is: min(14 + |2 - 3|, 16 + |5 - 3|)=min(14 + 1, 16 + 2)=min(15, 18)=15; 
  4. temperature in cell 4 is: min(14 + |2 - 4|, 16 + |5 - 4|)=min(14 + 2, 16 + 1)=min(16, 17)=16; 
  5. temperature in cell 5 is: min(14 + |2 - 5|, 16 + |5 - 5|)=min(14 + 3, 16 + 0)=min(17, 16)=16; 
  6. temperature in cell 6 is: min(14 + |2 - 6|, 16 + |5 - 6|)=min(14 + 4, 16 + 1)=min(18, 17)=17. 



For each cell from 1 to n find the temperature in it.

Input

The first line contains one integer q (1 ≤ q ≤ 10^4) — the number of test cases in the input. Then test cases follow. Before each test case, there is an empty line.

Each test case contains three lines. The first line contains two integers n (1 ≤ n ≤ 3 ⋅ 10^5) and k (1 ≤ k ≤ n) — the length of the strip of land and the number of air conditioners respectively.

The second line contains k integers a_1, a_2, …, a_k (1 ≤ a_i ≤ n) — positions of air conditioners on the strip of land.

The third line contains k integers t_1, t_2, …, t_k (1 ≤ t_i ≤ 10^9) — temperatures of air conditioners.

It is guaranteed that the sum of n over all test cases does not exceed 3 ⋅ 10^5.

Output

For each test case output n integers separated by space: temperatures of air in cells.

Example

Input


5

6 2
2 5
14 16

10 1
7
30

5 5
3 1 4 2 5
3 1 4 2 5

7 1
1
1000000000

6 3
6 1 3
5 5 5


Output


15 14 15 16 16 17 
36 35 34 33 32 31 30 31 32 33 
1 2 3 4 5 
1000000000 1000000001 1000000002 1000000003 1000000004 1000000005 1000000006 
5 6 5 6 6 5 

Solution (in JAVA):

Solution:
import java.util.ArrayList;
import java.util.Collections;
import java.util.Comparator;
import java.util.PriorityQueue;
import java.util.StringTokenizer;
import java.util.TreeSet;
import java.io.IOException;
import java.io.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;

public class S2 {
	
	static class Reader {
		
		static BufferedReader reader;
		static StringTokenizer tokenizer;
		
		static void init(InputStream input) {
			reader = new BufferedReader(new InputStreamReader(input));
			tokenizer = new StringTokenizer("");
		}
		
		static String next() throws IOException {
			while(!tokenizer.hasMoreTokens()) {
				tokenizer = new StringTokenizer(reader.readLine());
			}
			return tokenizer.nextToken();
		}
		
		static int nextInt() throws IOException {
			return Integer.parseInt(next());
		}
		
		static long nextLong() throws IOException {
			return Long.parseLong(next());
		}
		
	}
	
	private static int n;
	private static int k;
	private static int q;
	private static int maxV = 1001000001;
	
	private static int[] x;
	
	private static int[] c;
		
	private static class AC implements Comparable<AC> {
		public boolean useful;
		public int temp;
		public int pos;
		public int index;
		public int leftBound;
		public int rightBound;
		
		@Override
		public String toString() {
			// TODO Auto-generated method stub
			return pos+" "+index+" "+leftBound+" "+rightBound+" "+temp;
		}
		
		public AC(int p) {
			// TODO Auto-generated constructor stub
			pos=p;
			useful=true;
		}
		
		public void setTemp(int temp) {
			this.temp = temp;
		}
		
		public int tempAt(int p) {
			return temp+Math.abs(pos-p);
		}
		
		@Override
		public int compareTo(AC o) {
			// TODO Auto-generated method stub
			return this.pos-o.pos;
		}
		
		public void checkRange() {
			leftBound=pos;
			int i=index-1;
			
			while(i>=0) {
				AC left = acs[i];
				if(!left.useful) {
					i--;
					continue;
				}
				if(left.temp<tempAt(left.pos)) {
					break;
				}
				else {
					left.useful=false;
				}
				i--;
			}
			if(i==-1) {
				leftBound=0;
			}
			else {
				AC other = acs[i];
				int dif = tempAt(other.pos)-other.temp;
				int x = (dif)/2;
				x+=other.pos+1;
				leftBound=x;
			}
			
			rightBound=pos;
			i=index+1;
			
			while(i<k) {
				AC right = acs[i];
				if(!right.useful) {
					i++;
					continue;
				}
				if(right.temp<tempAt(right.pos)) {
					break;
				}
				else {
					right.useful=false;
				}
				i++;
			}
			if(i==k) {
				rightBound=n-1;
			}
			else {
				AC other = acs[i];
				int dif = tempAt(other.pos)-other.temp;
				int x = (dif+1)/2;
				rightBound=other.pos-x;
			}
		}
	}
	
	private class TComp implements Comparator<AC> {
		@Override
		public int compare(AC o1, AC o2) {
			// TODO Auto-generated method stub
			return o1.temp-o2.temp;
		}
	}
	private class T0Comp implements Comparator<AC> {
		@Override
		public int compare(AC o1, AC o2) {
			// TODO Auto-generated method stub
			return o1.tempAt(0)-o2.tempAt(0);
		}
	}
	private class TNComp implements Comparator<AC> {
		@Override
		public int compare(AC o1, AC o2) {
			// TODO Auto-generated method stub
			return o1.tempAt(n-1)-o2.tempAt(n-1);
		}
	}
	
	private static AC[] acs;

	public void drun() throws IOException {
		Reader.init(System.in);
		
		PrintWriter out = new PrintWriter(System.out);
		
		int tc=1;
		tc = Reader.nextInt();
		
		main_loop:
		for(int tn=0; tn<tc; tn++) {
			
		//	q = Reader.nextInt();
			n = Reader.nextInt();
			k = Reader.nextInt();
						
			c=new int[n];
			
			for(int i=0; i<n; i++) {
				c[i] = maxV;
			}
			
			acs = new AC[k];
			
			for(int i=0; i<k; i++) {
				acs[i] = new AC(Reader.nextInt()-1);
			}
			
			for(int i=0; i<k; i++) {
				acs[i].setTemp(Reader.nextInt());
			}
			
			PriorityQueue<AC> rHeap = new PriorityQueue<>(new T0Comp());
			PriorityQueue<AC> lHeap = new PriorityQueue<>(new TNComp());
			
			for(int i=0; i<k; i++) {
				lHeap.add(acs[i]);
				rHeap.add(acs[i]);
			}
			
			int p;
			p=0;
			
			while(!rHeap.isEmpty() && p<n) {
				AC cur = rHeap.peek();
				if(cur.pos<p) {
					rHeap.poll();
				}
				else {
					c[p] = Math.min(c[p], cur.tempAt(p));
					p++;
				}
			}
			
			p=n-1;
			
			while(!lHeap.isEmpty() && p>=0) {
				AC cur = lHeap.peek();
				if(cur.pos>p) {
					lHeap.poll();
				}
				else {
					c[p] = Math.min(c[p], cur.tempAt(p));
					p--;
				}
			}
			
			int l = n;
			for(int i=0; i<l; i++) {
				out.print(c[i]+" ");
			}
			out.println();
			
		//	out.println(ans);
//			if(bruh) {
//				
//			}
//			else {
//				out.print("-1");
//			}
			
		//	out.write(("YES").getBytes());
		//	out.write(("NO").getBytes());
			
		//	out.write((ans+" ").getBytes());
		//	out.print("\n");
			
		}
		
		out.flush();
		out.close();
	}

	public static void main(String[] args) throws IOException {
		
		Reader.init(System.in);
		S2 obj = new S2();
		obj.drun();
						
	}

	
	static AC[] merge(AC[] a, AC[] b) {
		int m = a.length;
		int n = b.length;
		AC[] c = new AC[n+m];
		
		int j=0, k=0;
		while(j+k<m+n) {
			if(j>=m) {
				c[j+k] = b[k];
				k++;
			}
			else if(k>=n) {
				c[j+k] = a[j];
				j++;
			}
			else {
				int x = a[j].compareTo(b[k]);
				if(x<0) {
					c[j+k] = a[j];
					j++;
				}
				else {
					c[j+k] = b[k];
					k++;
				}
			}
		}
		return c;
	}
	
	static AC[] Msort(AC[] unsorted){
		int l = unsorted.length;
		
		if(l<=1) {
			return unsorted;
		}
		
		else {
			AC[] Msorted = new AC[l];
			AC[] m1 = new AC[l/2];
			AC[] m2 = new AC[l-(l/2)];
			
			for(int i=0; i<l; i++) {
				if(i<l/2) {
					m1[i] = unsorted[i];
				}
				else {
					m2[i-(l/2)] = unsorted[i];
				}
			}
			
			Msorted = merge(Msort(m1), Msort(m2));		
			
			return Msorted;
		}		
	}

}