#pragma GCC target("avx2")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
#define DEBUG
#ifdef DEBUG
template <class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <class T> ostream &operator<<(ostream &os, const vector<T> &v) {
    os << '{';
    for(int i = 0; i < (int)v.size(); i++) {
        if(i) { os << ','; }
        os << v[i];
    }
    os << '}';
    return os;
}
ostream &operator<<(ostream &os, const set<int> &se){
    os << '{';
    int now = 0;
    for(auto x : se){
        if(now) { os << ','; }
        os << x; 
        now++;
    }
    os << '}';
    return os;
}
void debugg() { cerr << endl; }
template <class T, class... Args>
void debugg(const T &x, const Args &... args) {
    cerr << " " << x;
    debugg(args...);
}
#define debug(...)                                                             \
    cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__)
#define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl
#else
#define debug(...) (void(0))
#define dump(x) (void(0))
#endif
using namespace std;
typedef long long ll;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<double> vd;
typedef pair<ll,ll> P;
typedef pair<int,int> pii;
typedef vector<P> vpl;
typedef tuple<ll,ll,ll> tapu;
#define rep(i,n) for(int i=0; i<(n); i++)
#define REP(i,a,b) for(int i=(a); i<(b); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
const int inf = (1<<30)-1;
const ll linf = 1LL<<61;
const int MAX = 510000;
int dy[8] = {0,1,0,-1,1,-1,-1,1};
int dx[8] = {-1,0,1,0,1,-1,1,-1};
const double pi = acos(-1);
const double eps = 1e-8;
template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){
	if(a>b){
		a = b; return true;
	}
	else return false;
}
template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){
	if(a<b){
		a = b; return true;
	}
	else return false;
}
template<typename T> inline void print(T &a){
    int sz = a.size();
    for(auto itr = a.begin(); itr != a.end(); itr++){
		cout << *itr;
        sz--;
        if(sz) cout << " ";
	}
    cout << "\n";
}
template<typename T1,typename T2> inline void print2(T1 a, T2 b){
	cout << a << " " << b << "\n";
}
template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){
	cout << a << " " << b << " " << c << "\n";
}
void mark() {cout << "#" << "\n";}
ll pcount(ll x) {return __builtin_popcountll(x);}
const int mod = 1e9 + 7;
//const int mod = 998244353;

void solve(){
    int n,k; cin >> n >> k;
    vpl a(k);
    set<P> se;
    rep(i,k) cin >> a[i].first, a[i].first--;
    rep(i,k) cin >> a[i].second;
    sort(all(a));
    vpl b = a;
    rep(i,k) swap(b[i].first, b[i].second);
    rep(i,k) se.emplace(b[i].first,i);
    vb v(k,false);
    while(!se.empty()){
        P p = *se.begin();
        se.erase(se.begin());
        int id = p.second;
        v[id] = true;
        if(id > 0 && !v[id-1]){
            P q = *se.find(P(b[id-1].first,id-1));
            se.erase(q);
            chmin(q.first,p.first+b[id].second-b[id-1].second);
            b[id-1].first = q.first;
            se.emplace(q);
        }
        if(id+1 < k && !v[id+1]){
            P q = *se.find(P(b[id+1].first,id+1));
            se.erase(q);
            chmin(q.first,p.first+b[id+1].second-b[id].second);
            b[id+1].first = q.first;
            se.emplace(q);
        }
    }
    rep(i,k) a[i].second = b[i].first;
    rep(i,n){
        auto itrl = lower_bound(all(a),P(i,-inf));
        auto itrr = lower_bound(all(a),P(i,-inf));
        ll ans = inf;
        if(itrl != a.begin()){
            itrl--;
            chmin(ans, (*itrl).second + abs(i-(*itrl).first));
        }
        if(itrr != a.end()){
            chmin(ans, (*itrr).second + abs((*itrr).first-i));
        }
        cout << ans << " \n"[i==n-1];
    }
}


int main(){
    //cin.tie(nullptr);
    //ios::sync_with_stdio(false);
    int t = 1;
    cin >> t;
    while(t--){
        solve();
    }
}