import sys

# sys.setrecursionlimit(1000006)
# sys.set_int_max_str_digits(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()

dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
# inf = -1-(-1 << 31)
inf = -1-(-1 << 62)

# md = 10**9+7
md = 998244353

from heapq import *

def solve():
    def push(l,r):
        if l>r:return
        if l==1:
            heappush(hp, (-r+1, 1, r))
        elif r==n:
            heappush(hp,(-n+l,l,n))
        else:
            heappush(hp,(-((r-l)//2),l,r))

    n,m=LI()
    hp=[]
    push(1,m-1)
    push(m+1,n)
    ans=[0]*(n+1)
    ans[m]=1
    for a in range(2,n+1):
        _,l,r=heappop(hp)
        if l==1:
            m=1
        elif r==n:
            m=n
        else:
            m=(l+r)//2
        ans[m]=a
        push(l,m-1)
        push(m+1,r)
    print(*ans[1:])

for _ in range(II()):solve()