import macros;macro ImportExpand(s:untyped):untyped = parseStmt($s[2])
# {.checks: off.}
ImportExpand "cplib/tmpl/citrus.nim" <=== "when not declared CPLIB_TMPL_CITRUS:\n    const CPLIB_TMPL_CITRUS* = 1\n    {.warning[UnusedImport]: off.}\n    {.hint[XDeclaredButNotUsed]: off.}\n    import os\n    import algorithm\n    import sequtils\n    import tables\n    import macros\n    import std/math\n    import sets\n    import strutils\n    import strformat\n    import sugar\n    import streams\n    import deques\n    import bitops\n    import heapqueue\n    import options\n    import hashes\n    const MODINT998244353* = 998244353\n    const MODINT1000000007* = 1000000007\n    #[ include cplib/utils/infl ]#\n    when not declared CPLIB_UTILS_INFL:\n        const CPLIB_UTILS_INFL* = 1\n        const INFi32* = 100100111.int32\n        const INFL* = int(3300300300300300491)\n    type double* = float64\n    let readNext = iterator(getsChar: bool = false): string {.closure.} =\n        while true:\n            var si: string\n            try: si = stdin.readLine\n            except EOFError: yield \"\"\n            for s in si.split:\n                if getsChar:\n                    for i in 0..<s.len():\n                        yield s[i..i]\n                else:\n                    if s.isEmptyOrWhitespace: continue\n                    yield s\n    proc input*(t: typedesc[string]): string = readNext()\n    proc input*(t: typedesc[char]): char = readNext(true)[0]\n    proc input*(t: typedesc[int]): int = readNext().parseInt\n    proc input*(t: typedesc[float]): float = readNext().parseFloat\n    macro input*(t: typedesc, n: varargs[int]): untyped =\n        var repStr = \"\"\n        for arg in n:\n            repStr &= &\"({arg.repr}).newSeqWith \"\n        parseExpr(&\"{repStr}input({t})\")\n    macro input*(ts: varargs[auto]): untyped =\n        var tupStr = \"\"\n        for t in ts:\n            tupStr &= &\"input({t.repr}),\"\n        parseExpr(&\"({tupStr})\")\n    macro input*(n: int, ts: varargs[auto]): untyped =\n        for typ in ts:\n            if typ.typeKind != ntyAnything:\n                error(\"Expected typedesc, got \" & typ.repr, typ)\n        parseExpr(&\"({n.repr}).newSeqWith input({ts.repr})\")\n    proc `fmtprint`*(x: int or string or char or bool): string = return $x\n    proc `fmtprint`*(x: float or float32 or float64): string = return &\"{x:.16f}\"\n    proc `fmtprint`*[T](x: seq[T] or Deque[T] or HashSet[T] or set[T]): string = return x.toSeq.join(\" \")\n    proc `fmtprint`*[T, N](x: array[T, N]): string = return x.toSeq.join(\" \")\n    proc `fmtprint`*[T](x: HeapQueue[T]): string =\n        var q = x\n        while q.len != 0:\n            result &= &\"{q.pop()}\"\n            if q.len != 0: result &= \" \"\n    proc `fmtprint`*[T](x: CountTable[T]): string =\n        result = x.pairs.toSeq.mapIt(&\"{it[0]}: {it[1]}\").join(\" \")\n    proc `fmtprint`*[K, V](x: Table[K, V]): string =\n        result = x.pairs.toSeq.mapIt(&\"{it[0]}: {it[1]}\").join(\" \")\n    proc print*(prop: tuple[f: File, sepc: string, endc: string, flush: bool], args: varargs[string, `fmtprint`]) =\n        for i in 0..<len(args):\n            prop.f.write(&\"{args[i]}\")\n            if i != len(args) - 1: prop.f.write(prop.sepc) else: prop.f.write(prop.endc)\n        if prop.flush: prop.f.flushFile()\n    proc print*(args: varargs[string, `fmtprint`]) = print((f: stdout, sepc: \" \", endc: \"\\n\", flush: false), args)\n    const LOCAL_DEBUG{.booldefine.} = false\n    macro getSymbolName(x: typed): string = x.toStrLit\n    macro debug*(args: varargs[untyped]): untyped =\n        when LOCAL_DEBUG:\n            result = newNimNode(nnkStmtList, args)\n            template prop(e: string = \"\"): untyped = (f: stderr, sepc: \"\", endc: e, flush: true)\n            for i, arg in args:\n                if arg.kind == nnkStrLit:\n                    result.add(quote do: print(prop(), \"\\\"\", `arg`, \"\\\"\"))\n                else:\n                    result.add(quote do: print(prop(\": \"), getSymbolName(`arg`)))\n                    result.add(quote do: print(prop(), `arg`))\n                if i != args.len - 1: result.add(quote do: print(prop(), \", \"))\n                else: result.add(quote do: print(prop(), \"\\n\"))\n        else:\n            return (quote do: discard)\n    proc `%`*(x: SomeInteger, y: SomeInteger): int =\n        result = x mod y\n        if y > 0 and result < 0: result += y\n        if y < 0 and result > 0: result += y\n    proc `//`*(x: SomeInteger, y: SomeInteger): int =\n        result = x div y\n        if y > 0 and result * y > x: result -= 1\n        if y < 0 and result * y < x: result -= 1\n    proc `^`*(x: SomeInteger, y: SomeInteger): int = x xor y\n    proc `&`*(x: SomeInteger, y: SomeInteger): int = x and y\n    proc `|`*(x: SomeInteger, y: SomeInteger): int = x or y\n    proc `>>`*(x: SomeInteger, y: SomeInteger): int = x shr y\n    proc `<<`*(x: SomeInteger, y: SomeInteger): int = x shl y\n    proc `%=`*(x: var SomeInteger, y: SomeInteger): void = x = x % y\n    proc `//=`*(x: var SomeInteger, y: SomeInteger): void = x = x // y\n    proc `^=`*(x: var SomeInteger, y: SomeInteger): void = x = x ^ y\n    proc `&=`*(x: var SomeInteger, y: SomeInteger): void = x = x & y\n    proc `|=`*(x: var SomeInteger, y: SomeInteger): void = x = x | y\n    proc `>>=`*(x: var SomeInteger, y: SomeInteger): void = x = x >> y\n    proc `<<=`*(x: var SomeInteger, y: SomeInteger): void = x = x << y\n    proc `[]`*(x, n: int): bool = (x and (1 shl n)) != 0\n    proc `[]=`*(x: var int, n: int, i: bool) =\n        if i: x = x or (1 << n)\n        else: (if x[n]: x = x xor (1 << n))\n    proc pow*(a, n: int, m = INFL): int =\n        var\n            rev = 1\n            a = a\n            n = n\n        while n > 0:\n            if n % 2 != 0: rev = (rev * a) mod m\n            if n > 1: a = (a * a) mod m\n            n >>= 1\n        return rev\n    #[ include cplib/math/isqrt ]#\n    when not declared CPLIB_MATH_ISQRT:\n        const CPLIB_MATH_ISQRT* = 1\n        proc isqrt*(n: int): int =\n            var x = n\n            var y = (x + 1) shr 1\n            while y < x:\n                x = y\n                y = (x + n div x) shr 1\n            return x\n    proc chmax*[T](x: var T, y: T): bool {.discardable.} = (if x < y: (x = y; return true; ) return false)\n    proc chmin*[T](x: var T, y: T): bool {.discardable.} = (if x > y: (x = y; return true; ) return false)\n    proc `max=`*[T](x: var T, y: T) = x = max(x, y)\n    proc `min=`*[T](x: var T, y: T) = x = min(x, y)\n    proc at*(x: char, a = '0'): int = int(x) - int(a)\n    proc Yes*(b: bool = true): void = print(if b: \"Yes\" else: \"No\")\n    proc No*(b: bool = true): void = Yes(not b)\n    proc YES_upper*(b: bool = true): void = print(if b: \"YES\" else: \"NO\")\n    proc NO_upper*(b: bool = true): void = Yes_upper(not b)\n    const DXY* = [(0, -1), (0, 1), (-1, 0), (1, 0)]\n    const DDXY* = [(1, -1), (1, 0), (1, 1), (0, -1), (0, 1), (-1, -1), (-1, 0), (-1, 1)]\n    macro exit*(statement: untyped): untyped = (quote do: (`statement`; quit()))\n    proc initHashSet[T](): Hashset[T] = initHashSet[T](0)\n"
ImportExpand "cplib/collections/tatyamset.nim" <=== "# https://github.com/tatyam-prime/SortedSet/blob/main/SortedMultiset.py\nwhen not declared CPLIB_COLLECTIONS_TATYAMSET:\n    import algorithm\n    import math\n    import sequtils\n    import sugar\n    import options\n    const CPLIB_COLLECTIONS_TATYAMSET* = 1\n\n    const BUCKET_RATIO = 8\n    const SPLIT_RATIO = 12\n    type SortedMultiSet*[T] = ref object\n        size: int\n        arr*: seq[seq[T]]\n    proc initSortedMultiset*[T](v: seq[T] = @[]): SortedMultiSet[T] =\n        #Make a new SortedMultiset from seq. / O(N) if sorted / O(N log N)\n        var v = v\n        if not isSorted(v):\n            v.sort()\n        var n = len(v)\n        var bucket_size = int(ceil(sqrt(n/BUCKET_RATIO)))\n        var arr = collect(newseq): (for i in 0..<bucket_size: v[(n*i div bucket_size) ..< (n*(i+1) div bucket_size)])\n        result = SortedMultiSet[T](size: n, arr: arr)\n\n    proc len*(self: SortedMultiSet): int =\n        return self.size\n\n    proc position[T](self: SortedMultiSet[T], x: T): (int, int) =\n        #\"return the bucket, index of the bucket and position in which x should be. self must not be empty.\"\n        for i in 0..<self.arr.len:\n            if x <= self.arr[i][^1]:\n                return (i, self.arr[i].lowerBound(x))\n        return (len(self.arr)-1, self.arr[^1].lowerBound(x))\n\n    proc contains*[T](self: SortedMultiSet[T], x: T): bool =\n        if self.size == 0: return false\n        var (i, j) = self.position(x)\n        return j != len(self.arr[i]) and self.arr[i][j] == x\n\n    proc incl*[T](self: SortedMultiSet[T], x: T) =\n        #\"Add an element. / O(√N)\"\n        if self.size == 0:\n            self.arr = @[@[x]]\n            self.size = 1\n            return\n        var (b, i) = self.position(x)\n        self.arr[b].insert(x, i)\n        self.size += 1\n        if len(self.arr[b]) > len(self.arr) * SPLIT_RATIO:\n            var mid = len(self.arr[b]) shr 1\n            self.arr.insert(self.arr[b][mid..<len(self.arr[b])], b+1)\n            self.arr[b] = self.arr[b][0..<mid]\n\n    proc innerpop[T](self: SortedMultiSet[T], b: int, i: int): T{.discardable.} =\n        var b = b\n        if b < 0:\n            b = self.size + b\n        var ans = self.arr[b][i]\n        self.arr[b].delete(i)\n        self.size -= 1\n        if len(self.arr[b]) == 0: self.arr.delete(b)\n        return ans\n\n    proc excl*[T](self: SortedMultiSet[T], x: T): bool{.discardable.} =\n        #\"Remove an element and return True if removed. / O(√N)\"\n        if self.size == 0: return false\n        var (b, i) = self.position(x)\n        if i == len(self.arr[b]) or self.arr[b][i] != x: return false\n        self.innerpop(b, i)\n        return true\n\n    proc lt*[T](self: SortedMultiSet[T], x: T): Option[T] =\n        #\"Find the largest element < x, or None if it doesn't exist.\"\n        for i in countdown(len(self.arr)-1, 0, 1):\n            if self.arr[i][0] < x:\n                return some(self.arr[i][lowerBound(self.arr[i], x) - 1])\n        return none(T)\n\n    proc le*[T](self: SortedMultiSet[T], x: T): Option[T] =\n        #\"Find the largest element <= x, or None if it doesn't exist.\"\n        for i in countdown(len(self.arr)-1, 0, 1):\n            if self.arr[i][0] <= x:\n                return some(self.arr[i][upperBound(self.arr[i], x) - 1])\n        return none(T)\n\n    proc gt*[T](self: SortedMultiSet[T], x: T): Option[T] =\n        #\"Find the smallest element > x, or None if it doesn't exist.\"\n        for i in 0..<len(self.arr):\n            if self.arr[i][^1] > x:\n                return some(self.arr[i][upperBound(self.arr[i], x)])\n        return none(T)\n\n    proc ge*[T](self: SortedMultiSet[T], x: T): Option[T] =\n        #\"Find the smallest element >= x, or None if it doesn't exist.\"\n        for i in 0..<len(self.arr):\n            if self.arr[i][^1] >= x:\n                return some(self.arr[i][lowerBound(self.arr[i], x)])\n        return none(T)\n\n    proc `[]`*[T](self: SortedMultiSet[T], i: int): T =\n        var i = i\n        #\"Return the i-th element.\"\n        if i < 0:\n            for j in countdown(len(self.arr)-1, 0, 1):\n                i += len(self.arr[j])\n                if i >= 0: return self.arr[j][i]\n        else:\n            for j in 0..<len(self.arr):\n                if i < len(self.arr[j]): return self.arr[j][i]\n                i -= len(self.arr[j])\n        raise newException(IndexDefect, \"index \" & $i & \" not in 0 .. \" & $(self.size-1))\n\n    proc pop*[T](self: SortedMultiSet[T], i: int = -1): T =\n        #\"Pop and return the i-th element.\"\n        var i = i\n        if i < 0:\n            for b in countdown(len(self.arr)-1, 0, 1):\n                i += len(self.arr[b])\n                if i >= 0: return self.innerpop(not b, i)\n        else:\n            for b in 0..<len(self.arr):\n                if i < len(self.arr[b]): return self.innerpop(b, i)\n                i -= len(self.arr[b])\n        raise newException(IndexDefect, \"index \" & $i & \" not in 0 .. \" & $(self.size-1))\n\n    proc index*[T](self: SortedMultiSet[T], x: T): int =\n        #\"Count the number of elements < x.\"\n        for i in 0..<len(self.arr):\n            if self.arr[i][^1] >= x:\n                return result + lowerBound(self.arr[i], x)\n            result += len(self.arr[i])\n\n    proc index_right*[T](self: SortedMultiSet[T], x: T): int =\n        #\"Count the number of elements <= x.\"\n        for i in 0..<len(self.arr):\n            if self.arr[i][^1] > x:\n                return result + upperBound(self.arr[i], x)\n            result += len(self.arr[i])\n    proc count*[T](self: SortedMultiSet[T], x: T): int =\n        #\"Count the number of x.\"\n        return self.index_right(x) - self.index(x)\n\n    iterator items*[T](self: SortedMultiSet[T]): T =\n        for i in 0..<len(self.arr):\n            for j in self.arr[i]:\n                yield j\n"

proc solve() =
    var n, m = input(int)
    m -= 1
    var st = initSortedMultiset[(int, int, int)]()
    if m != 0: st.incl((-m, -m+1, m))
    if m != n-1: st.incl((-(n-1-m), m+1, n-1+(n-m)-1))
    var ans = newSeq[int](n)
    ans[m] = 1
    for i in 2..n:
        var (w, l, r) = st[0]
        debug(w, l, r)
        st.excl((w, l, r))
        var x = (l+r-1) // 2
        ans[x] = i
        if x != l and l >= 0:
            var w = x - l
            st.incl((-((w+1) // 2), l, x))
        if x != r-1 and r < n:
            var w = r - (x+1)
            st.incl((-((w+1) // 2), x+1, r))
    print(ans)

var t = input(int)
for _ in 0..<t: solve()