using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var t = NN;
        var ans = new int[t][];
        for (var u = 0; u < t; ++u)
        {
            var c = NList;
            ans[u] = Space(c[0], c[1]);
        }
        WriteLine(string.Join("\n", ans.Select(ai => string.Join(" ", ai))));
    }
    static int[] Space(int n, int m)
    {
        --m;
        var ans = new int[n];
        ans[m] = 1;
        var q = new PriorityQueue<Pair>(n, false);
        if (m > 0) q.Enqueue(new Pair(0, m - 1, true));
        if (m + 1 < n) q.Enqueue(new Pair(m + 1, n - 1, true));
        for (var i = 2; i <= n; ++i)
        {
            var cur = q.Dequeue();
            var pos = cur.L + (cur.R - cur.L) / 2;
            if (cur.L == 0) pos = 0;
            else if (cur.R == n - 1) pos = n - 1;
            ans[pos] = i;
            if (cur.L < pos) q.Enqueue(new Pair(cur.L, pos - 1, cur.L == 0));
            if (pos < cur.R) q.Enqueue(new Pair(pos + 1, cur.R, cur.R + 1 == n));
        }
        return ans;
    }
    class Pair : IComparable<Pair>
    {
        public int L;
        public int R;
        public bool IsEdge;
        public Pair(int l, int r, bool isEdge)
        {
            L = l; R = r; IsEdge = isEdge;
        }
        int Dist()
        {
            if (IsEdge) return R - L;
            else return (R - L) / 2;
        }
        public int CompareTo(Pair b)
        {
            var d = b.Dist().CompareTo(Dist());
            if (d != 0) return d;
            return L.CompareTo(b.L);
        }
    }
    class PriorityQueue<T> where T : IComparable<T>
    {
        public T[] List;
        public int Count;
        bool IsTopMax;
        public PriorityQueue(int count, bool isTopMax)
        {
            IsTopMax = isTopMax;
            List = new T[Math.Max(128, count)];
        }
        public void Enqueue(T value)
        {
            if (Count == List.Length)
            {
                var newlist = new T[List.Length * 2];
                for (var i = 0; i < List.Length; ++i) newlist[i] = List[i];
                List = newlist;
            }
            var pos = Count;
            List[pos] = value;
            ++Count;
            while (pos > 0)
            {
                var parent = (pos - 1) / 2;
                if (Calc(List[parent], List[pos], true)) break;
                Swap(parent, pos);
                pos = parent;
            }
        }
        public T Dequeue()
        {
            --Count;
            Swap(0, Count);
            var pos = 0;
            while (true)
            {
                var child = pos * 2 + 1;
                if (child >= Count) break;
                if (child + 1 < Count && Calc(List[child + 1], List[child], false)) ++child;
                if (Calc(List[pos], List[child], true)) break;
                Swap(pos, child);
                pos = child;
            }
            return List[Count];
        }
        bool Calc(T a, T b, bool equalVal)
        {
            var ret = a.CompareTo(b);
            if (ret == 0 && equalVal) return true;
            return IsTopMax ? ret > 0 : ret < 0;
        }
        void Swap(int a, int b)
        {
            var tmp = List[a];
            List[a] = List[b];
            List[b] = tmp;
        }
    }
}