from heapq import heappop,heappush
for _ in range(int(input())):
    n,m = map(int,input().split())
    m-= 1; p = [0]*n; p[m] = 1; h = []
    q = list(range(m,0,-1))+list(range(n-m))
    for i,v in enumerate(q): heappush(h,(-v,i))
    for j in range(2,n+1):
        while 1:
            v,i = heappop(h)
            if q[i]==-v: break
        p[i] = j; q[i] = 0
        for k in range(i-1,-1,-1):
            if q[k]<=i-k: break
            q[k] = i-k; heappush(h,(-q[k],k))
        for k in range(i+1,n):
            if q[k]<=k-i: break
            q[k] = k-i; heappush(h,(-q[k],k))
    print(*p)