import heapq
T = int(input())
MAX = 10**10
for _ in range(T):
    n, m = map(int, input().split())
    ans = [-1] * n
    h = []
    heapq.heapify(h)

    def set(l, r):
        heapq.heappush(h, (l - r, l, r))

    ans[m - 1] = 0
    if m - 1 >= 1:
        set(-MAX, m - 1)
    if m < n:
        set(m, MAX)

    for i in range(1, n):
        d, l, r = heapq.heappop(h)
        mid = 0
        if l == -MAX:
            mid = 0
            set(1, r)
        elif r == MAX:
            mid = n - 1
            set(l, n - 1)
        else:
            mid = (l + r) // 2
            set(l, mid)
            set(mid + 1, r)

        ans[mid] = i
    print(*[a + 1 for a in ans])