#include <stdio.h>
#include <vector>

long long int power(long long int a, long long int b, int p)
{
	long long int ans = 1;
	long long int k = a;
	while(b)
	{
		if(b%2==1) ans*=k, ans%=p;
		k*=k, k%=p;
		b/=2;
	}
	return ans;
}
long long int inv(long long int a, int p)
{
	return power(a,p-2,p);
}

long long int fact[110];
std::vector<int> ans;
long long int check[100010];
std::vector<int> save[1010][110];

int main()
{
	fact[0] = 1;
	int T;
	scanf("%d",&T);
	while(T--)
	{
		ans.clear();
		int a,b;
		scanf("%d%d",&a,&b);
		if(!save[a][b].empty())
		{
			for(int i=0;i<save[a][b].size();i++) printf("%d ",save[a][b][i]);
			printf("\n");
			continue;
		}
		int p = a*b+1;
		
		int count = 0;
		for(int i=1;i<=a*b;i++) check[i] = 0;
		for(int i=1;i<=a*b;i++)
		{
			if(check[i]==0)
			{
				long long int t = power(i,b,p);
				long long int i2 = i;
				long long int s = t;
				
				while(check[i2]==0)
				{
					check[i2] = s;
					if(s==1) count++;
					if(count>=b) goto u;
					i2 = (i2*i)%p;
					s = (s*t)%p;
				}
			}
		}
		u:;
		for(int i=1;i<=a*b;i++) if(check[i]==1) ans.push_back(i);
		save[a][b] = ans;
		for(int i=0;i<ans.size();i++) printf("%d ",ans[i]);
		printf("\n");
	}
}