Air Conditioners
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 \le a_i \le 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$$$.  Example of strip of length $$$n=6$$$, where $$$k=2$$$, $$$a=[2,5]$$$ and $$$t=[14,16]$$$. For each cell $$$i$$$ ($$$1 \le i \le n$$$) find it's temperature, that can be calculated by the formula $$$$$$\min_{1 \le j \le 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:  temperature in cell $$$1$$$ is: $$$\min(14 + |2 - 1|, 16 + |5 - 1|)=\min(14 + 1, 16 + 4)=\min(15, 20)=15$$$;  temperature in cell $$$2$$$ is: $$$\min(14 + |2 - 2|, 16 + |5 - 2|)=\min(14 + 0, 16 + 3)=\min(14, 19)=14$$$;  temperature in cell $$$3$$$ is: $$$\min(14 + |2 - 3|, 16 + |5 - 3|)=\min(14 + 1, 16 + 2)=\min(15, 18)=15$$$;  temperature in cell $$$4$$$ is: $$$\min(14 + |2 - 4|, 16 + |5 - 4|)=\min(14 + 2, 16 + 1)=\min(16, 17)=16$$$;  temperature in cell $$$5$$$ is: $$$\min(14 + |2 - 5|, 16 + |5 - 5|)=\min(14 + 3, 16 + 0)=\min(17, 16)=16$$$;  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.
The first line contains one integer $$$q$$$ ($$$1 \le q \le 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 \le n \le 3 \cdot 10^5$$$) and $$$k$$$ ($$$1 \le k \le 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, \ldots, a_k$$$ ($$$1 \le a_i \le n$$$) — positions of air conditioners on the strip of land.The third line contains $$$k$$$ integers $$$t_1, t_2, \ldots, t_k$$$ ($$$1 \le t_i \le 10^9$$$) — temperatures of air conditioners.It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$3 \cdot 10^5$$$.
For each test case output $$$n$$$ integers separated by space: temperatures of air in cells.
import fileinput

def main():
    it = fileinput.input()
    num_cases = int(next(it))
    for _ in range(num_cases):
        next(it)
        (land_length, _) = list(map(int, next(it).split()))
        poss = list(map(int, next(it).split()))
        temps = list(map(int, next(it).split()))
        room_temp_l = [float('+inf')] * land_length
        room_temp_r = [float('+inf')] * land_length
        for (pos, temp) in zip(poss, temps):
            room_temp_l[pos - 1] = temp
            room_temp_r[pos - 1] = temp
        cur_min = room_temp_l[0]
        for i in range(1, land_length):
            if cur_min + 1 < room_temp_l[i]:
                room_temp_l[i] = cur_min + 1
                cur_min += 1
            else:
                cur_min = room_temp_l[i]
        cur_min = room_temp_r[-1]
        for i in range(land_length - 2, -1, -1):
            if cur_min + 1 < room_temp_r[i]:
                room_temp_r[i] = cur_min + 1
                cur_min += 1
            else:
                cur_min = room_temp_r[i]
        for i in range(0, land_length):
            room_temp_l[i] = min(room_temp_l[i], room_temp_r[i])
        print(' '.join(map(str, room_temp_l)))
main()
result = []

def code():
    (n, k) = map(int, input().split())
    pos_k = list(map(int, input().split()))
    temp = list(map(int, input().split()))
    big = 10 ** 10 + 1
    L = [big] * n
    for x in range(k):
        L[pos_k[x] - 1] = temp[x]
    R = L[:]
    current = big + 1
    for x in range(n):
        current = min(current + 1, L[x])
        L[x] = current
    current2 = big + 1
    for x in range(n - 1, -1, -1):
        current2 = min(current2 + 1, R[x])
        R[x] = current2
    result.append(list((min(R[x], L[x]) for x in range(n))))
q = int(input())
for test in range(q):
    nothing = input()
    code()
for x in result:
    print(' '.join((str(y) for y in x)))
from math import inf

def cf1547e():
    input()
    (n, k) = map(int, input().split())
    pos = list(map(int, input().split()))
    tem = list(map(int, input().split()))
    ans = [inf] * n
    for (i, x) in enumerate(pos):
        ans[x - 1] = tem[i]
    for i in range(1, n):
        ans[i] = min(ans[i], ans[i - 1] + 1)
    for i in range(n - 2, -1, -1):
        ans[i] = min(ans[i], ans[i + 1] + 1)
    print(*ans)
if __name__ == '__main__':
    t = int(input())
    for _ in range(t):
        cf1547e()