#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main()
{
	int a,b,n,t;
	cin>>t;
	for(int k=1;k<=t;++k)
	{
		cin>>n>>a>>b;
		vector<int> ans;
		if(a>b)
			swap(a,b);
		for(int i=1;i<=n;++i)
			ans.push_back((i-1)*a+(n-i)*b);
		sort(ans.begin(),ans.end());
        cout<<ans[0]<<" ";
		for(int i=1;i<ans.size();++i)
            if(ans[i]!=ans[i-1])
			cout<<ans[i]<<" ";
		cout<<endl;
	}
	return 0;
}