#include <bits/stdc++.h>
#include <stack>
#include <string>
#include <cmath>
#include <iomanip>
using namespace std;
#define bye return 0
#define godspeed ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
#define ll long long
#define pb push_back
#define mp make_pair
#define F first
#define S second
#define fo(i,n) for(ll i=0;i<n;i++)
#define ffo(i,k,n) for(ll i=k;k<n?i<n:i>n;k<n?i+=1:i-=1)
#define all(x) x.begin(), x.end()
#define PI 3.1415926535897932384626
#define c(n) \
    ll n; \
    cin >> n
typedef pair<int, int>  pii;
typedef pair<ll, ll>    pl;
typedef vector<int>     vi;
typedef vector<ll>      vl;
typedef unordered_map<int, int> umi;
typedef vector<pii>     vpii;
typedef vector<pl>      vpl;
typedef vector<vi>      vvi;
typedef vector<vl>      vvl;
 
const int N = 1000001;
ll power(ll a, ll b)
{
    ll res=1;
    while(b>0)
    {
        if(b&1)res=res*a;
        b>>=1;
        a*=a;
    }
    return res;
}
ll binarysearchlf(ll l,ll h, vl &a,ll k)
{
    while(l<h)
    {
        ll mid=l+((h-l+1)/2);
        if(a[mid]<k) l=mid;
        else h=mid-1;
    }
    return l;
}
ll binarysearchft(ll l,ll h, vl &a,ll k)
{
    while(l<h)
    {
        ll mid=l+((h-l)/2);
        if(a[mid]<k) l=mid+1;
        else h=mid;
    }
    return l;
}
ll gcd(ll a, ll b) 
{ 
    if (b == 0) 
        return a; 
    return gcd(b, a % b);  
      
}
bool sortrev(ll a,ll b)
{
    return a>=b;
} 
ll lcm(ll a, ll b)
{
    return (a/gcd(a,b))*b;
}
int main()
{
    godspeed;
    c(t);
    while(t--)
    {
        c(n);c(k);
        vl v(n,0);
        vl v1(n,0);
        vl a(k);
        vl m(k);
        fo(i,k)cin>>a[i];
        fo(i,k)cin>>m[i];
        fo(i,k){v[a[i]-1]=m[i];v1[a[i]-1]=m[i];}
        ll cp=a[0],ct=m[0];
        ll q=1;
        fo(i,n)
        {
            if(v[i]>0)
            {
                if(abs((i+1)-cp)+ct>=v[i])
                {
                    ct=v[i];
                    cp=i+1;
                }
                else
                {
                    v[i]=abs((i+1)-cp)+ct;
                }
            }
            else
            {
                v[i]=abs((i+1)-cp)+ct;
            }
        }
        cp=a[k-1];
        ct=m[k-1];
        q=k-2;
        ffo(i,n-1,-1)
        {
            if(v1[i]>0)
            {
                if(abs((i+1)-cp)+ct>=v1[i])
                {
                    ct=v1[i];
                    cp=i+1;
                    v1[i]=ct;
                }
                else
                {
                    v1[i]=abs((i+1)-cp)+ct;
                }
            }
            else
            {
                v1[i]=abs((i+1)-cp)+ct;
            }
        }
        vl ans(n);
        fo(i,n)ans[i]=min(v[i],v1[i]);
        fo(i,n)cout<<ans[i]<<" ";
        cout<<endl;
    }
    bye;
}