#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#define BOOL char
#define TRUE 1
#define FALSE 0

int n, k;

typedef struct Node Node;
struct Node{
    int element;
    Node *prev;
    Node *next;
};

Node *head;

void Initlist()
{
    head = (Node *)malloc(sizeof(Node));
    head->prev = NULL;
    head->next = NULL;
}

Node *insertNode(Node *Target, Node *aNode)
{
    Node *New;
    Node *Right;

    New = (Node *)malloc(sizeof(Node));
    *New = *aNode;

    Right = Target->next;
    New->next = Right;
    New->prev = Target;
    Target->next = New;
    if (Right) {
        Right->prev = New;
    }
    return New;
}


BOOL DeleteNode(Node *Target)
{
    Node *Left, *Right;

    if (Target == NULL || Target == head) {
        return FALSE;
    }

    Left = Target->prev;
    Right = Target->next;

    Left->next = Right;
    Right->prev = Left;
    head->next = Right;
    free(Target);

    return TRUE;
}

void UnInitList()
{
    while (DeleteNode(head)) { ; }

    free(head);
    head = NULL;
}

void input()
{
    scanf("%d %d", &n, &k);
}

void process()
{
    int i, count, countnum = 0;
    Node *Now, Temp;

    // 리스트 초기화
    Initlist();

    count = n;
    Now = head; 
    // n만큼 노드 삽입(시계 방향)
    for (i = 1; i <= n; i++)
    {
        Temp.element = i;
        Now = insertNode(Now, &Temp);

        if (i == n)
        {
            Now->next = head->next;
            Now->next->prev = Now;
        }
    }

    DeleteNode(head->next);
    count--;
    while (count != 2)
    {
        for (Now = head->next; Now; Now = Now->next)
        {
            if (countnum == k - 1)
            {
                DeleteNode(Now);
                break;
            }
            countnum++;
        }
        countnum = 0;
        count--;
    }
}

void output()
{
    printf("%d %d ", head->next->element, head->next->next->element);
    UnInitList();
}

int main()
{
    int t;
    //freopen("input.txt", "r", stdin);
    scanf("%d", &t);

    while (t--)
    {
        input();
        process();
        output();
    }
    return 0;
}