#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#define N 11111111
#define M 1111111
#define mod 1000000007ll
ll t, n, a, b, sum;
int f[N], g[N], pme[M], pe[N], cnt[N], pos;
bool npme[N];
void init2(){
	n = 10000000;
	for(int i = 2 ; i <= n ; i++){
		if(!npme[i]){
			pme[++pos] = i;
			pe[i] = i;
		}
		cnt[i] = pos;
		for(int j = 1 ; pme[j] * i <= n && j <= pos ; j++){
			npme[i * pme[j]] = true;
			if(i % pme[j] == 0){
				pe[i * pme[j]] = pe[i] * pme[j];
				break;
			}
			else
				pe[i * pme[j]] = pme[j];
		}
	}
}
void init(){
	for(int i = 2 ; i <= n ; i++){
		if(!npme[i]){
			//pme[++pos] = i;
			//pe[i] = i;
			f[i] = (a + b * i) % mod;
			//f[i] %= mod;
			g[i] = 1;
		}
		for(int j = 1 ; pme[j] * i <= n && j <= cnt[i] ; j++){
			//npme[i * pme[j]] = true;
			if(i % pme[j] == 0){
				//pe[i * pme[j]] = pe[i] * pme[j];
				f[i * pme[j]] = 1ll * g[i] * (f[pe[i]] + a) % mod;
				g[i * pme[j]] = g[i];
				break;
			}
			else{
				//pe[i * pme[j]] = pme[j];
				f[i * pme[j]] = 1ll * f[i] * f[pme[j]] % mod;
				g[i * pme[j]] = f[i];
			}
		}
		sum = (f[i] + sum) % mod;
	}
}
int main(){
	cin >> t;
	init2();
	while(t--){
		pos = 0;
		sum = 1;
		cin >> n >> a >> b;
		init();
		cout << sum << "\n";
	}
	return 0;
}