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 CPP):

Solution:
// CSES Round Trip
// Nabajyoti Majumdar

#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using ld= long double;
using vi = vector<int>;
using vc=vector<char>;
#define pb push_back
#define rsz resize
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
using pii = pair<ll,ll>;
#define ff first
#define ss second
// #define mp make_pair
const int mod=1e9+7;
const ll inf=INT_MAX;

const int kMaxn=1e5+5;

int dir[4][2]={{0,1},{1,0},{-1,0},{0,-1}};


void setIO(string name = "") { // name is nonempty for USACO file I/O

      ios_base::sync_with_stdio(0); cin.tie(0); // see Fast Input & Output

      // if(sz(name)){

      //       freopen((name+".in").c_str(), "r", stdin); // see Input & Output

      //       freopen((name+".out").c_str(), "w", stdout);

      // }
      return;

}

void solve(){
   ll n,k;
   cin>>n>>k;

   vector<pii>A(k);
   for(int i=0;i<k;i++){
      cin>>A[i].ff; // positions
   }

   for(int i=0;i<k;i++){
      cin>>A[i].ss; // temperatures
   }

   vector<ll>v(n,inf);

   for(int i=0;i<k;i++){
      v[A[i].ff-1]=A[i].ss;
   }

   vector<ll>left(n,inf),right(n,inf);

   ll mini=v[0];
   mini++;
   
   left[0]=v[0];

   // left to right
   for(int i=1;i<n;i++){
      mini=min(mini,v[i]);
      left[i]=mini;
      mini++;
   }

   right[n-1]=v[n-1];
   mini=v[n-1];
   mini++;
   for(int i=n-2;i>=0;i--){
      mini=min(mini,v[i]);
      right[i]=mini;
      mini++;
   }

   for(int i=0;i<n;i++){
      cout<<min(left[i],right[i])<<" ";
   }
   cout<<endl;



}


int main(){
   setIO();
   //--------------//
   int t;
   cin>>t;
   while(t--){
      solve();
   }
   //------------//
   return 0;
}


// ------Union Find---------
// class UnionFind{
// public:

//   vector<int> component;
//   vector<int>rank;
//   int distinct;


//   UnionFind(int n){
//     distinct=n;
//     for(int i=0;i<=n;i++){
//       component.push_back(i);
//       rank.push_back(0);
//     }
//   }

//   bool unite(int a,int b){
//     int rootA=findComponent(a);
//     int rootB=findComponent(b);

//     if(rootA==rootB){
//       return false;
//     }

//     if(rank[rootA]<rank[rootB]){
//       component[rootA]=rootB;
//     }else{
//       if(rank[rootA]==rank[rootB]){
//         rank[rootA]++;
//       }
//       component[rootB]=rootA;
//     }
//     distinct--;
//     return true;
//   }

//   int findComponent(int a){
//     if(component[a]!=a){
//       component[a]=findComponent(component[a]);
//     }
//     return component[a];
//   }

//   bool connected(int a,int b){
//     return findComponent(a)==findComponent(b);
//   }
// };


//---- DFS tree----------

// const int kMaxN=1e5+5;

// vector<int>vertex[kMaxN]; // the adjacency list

// bool visited[kMaxN]={0};

// int parent[kMaxN]={0};

// vector<pii> free_edges;

// //  DFS

// bool hoise=false;
// vi nodes;

// void Df(int node){
//    visited[node]=true;
//    for(auto itr:vertex[node]){
//       if(itr==parent[node]) continue;
//       if(!visited[itr]){
//          parent[itr]=node;
//          Df(itr);
//       }else{
//          if(itr<node){
//             free_edges.pb({node,itr});
//             hoise=true;
//          }
//       }
//    }
//    return;
// }










// bool hoibo=true;

// void BFS(int x){
//    queue<int>q;
//    q.push(x);
//    color[x]=0;
//    visited[x]=1;

//    for(int lvl=1;!q.empty();lvl++){
//       int sz=q.size();
//       while(sz--){
//          int cur=q.front(); q.pop();
//          visited[cur]=1;
//          for(int aa:vertex[cur]){
//             if(color[aa]==1-(lvl%2)){
//                cout<<"IMPOSSIBLE"<<endl;
//                hoibo=false;
//                return ;
//             }

//             if(visited[aa]) continue;
//             color[aa]=(lvl%2);
//             q.push(aa);
//          }
//       }
//    }

// }