## https://yukicoder.me/problems/no/2771

import heapq

class BinaryIndexTree:
    """
    フェニック木(BinaryIndexTree)の基本的な機能を実装したクラス
    """
    def __init__(self, size):
        self.size = size
        self.array = [0] * (size + 1)
    
    def add(self, x, a):
        index = x
        while index <= self.size:
            self.array[index] += a
            index += index & (-index)
    
    def sum(self, x):
        index = x
        ans = 0
        while index > 0:
            ans += self.array[index]
            index -= index & (-index)
        return ans

    def least_upper_bound(self, value):
        if self.sum(self.size) < value:
            return -1
        elif value <= 0:
            return 0

        m = 1
        while m < self.size:
            m *= 2

        k = 0
        k_sum = 0
        while m > 0:
            k0 = k + m
            if k0 < self.size:
                if k_sum + self.array[k0] < value:
                    k_sum += self.array[k0]
                    k += m
            m //= 2
        if k < self.size:
            return k + 1
        else:
            return -1


def solve(N, M):
    array = [-1] * N
    array[M - 1] = 1

    bit = BinaryIndexTree(N)
    bit.add(M, 1)

    queue = []
    if M > 1:
        heapq.heappush(queue, (-(M - 1), 1))
    if N > M:
        heapq.heappush(queue, (-(N - M), N))

    ind = 2
    while len(queue) > 0:
        _, v = heapq.heappop(queue)
        array[v - 1] = ind
        ind += 1

        # 左側計算
        l = bit.sum(v)
        if l > 0:
            left = bit.least_upper_bound(l)
            if v - left > 1:
                d = (v - left) // 2
                heapq.heappush(queue, (-d, left + d))
        
        # 右側の計算
        if l + 1 <= bit.sum(bit.size):
            right = bit.least_upper_bound(l + 1)
            if right - v > 1:
                d= (right - v) // 2
                heapq.heappush(queue, (-d, v + d))
        
        bit.add(v, 1)

    return " ".join(map(str, array))




def main():
    T = int(input())
    answers = []
    for _ in range(T):
        N, M = map(int, input().split())
        ans = solve(N, M)
        answers.append(ans)

    for ans in answers:
        print(ans)




    



if __name__ == '__main__':
    main()