#include <iostream>
#include <cstdio>
#include <unordered_map>
#include <algorithm>
#include <cstring>
#include <vector>
using namespace std;

typedef long long LL;

const int S = 1e5 + 1, T = 1e5 + 1, INF = 0x3f3f3f3f, P = 1e9 + 7;

int primes[S], tot, fac[S], mu[S], h[S], d[8], top[8], A[8][S * 20], B[8][S * 20];

bool st[S], vis[S];

int F[8][T], G[8][T];

vector<int> e[S];

int s[S], ans;
int a, b, c; 

int f(int n, int k) {
	if (n == 0) return 0;
	if (n == 1) return 1;
	if (k == 0) return mu[n];
	if (F[k][n] != -1) return F[k][n];
	else {
	    ++top[k];
		A[k][top[k]] = k, B[k][top[k]] = n;
		int p = fac[d[k]];
		return F[k][n] = (f(n, k - 1) + f(n / p, k)) % P;
	} 
}

void init() {
	for (int i = 1; i < S; i++) mu[i] = 1;
	for (int i = 2; i < S; i++) {
		if (!st[i]) primes[++tot] = i, mu[i] = -1, fac[i] = i;
		for (int j = 1; primes[j] * i < S; j++) {
			st[primes[j] * i] = true;
			fac[primes[j] * i] = primes[j];
			if (i % primes[j] == 0) {
				mu[i * primes[j]] = 0;
				break;
			}
			mu[i * primes[j]] = -mu[i];
		}
	}
	
	for (int i = 2; i < S; i++) (mu[i] += mu[i - 1] + P) %= P;
}


int g(int n, int k) {
	if (n == 0) return 0;
	if (G[k][n] != -1) return G[k][n];
	else if (k > 0) {
	    ++top[k];
		A[k][top[k]] = k, B[k][top[k]] = n;
		int p = fac[d[k]];
		return G[k][n] = ((LL)g(n, k - 1) - g(n / p, k - 1) + P) % P;
	} else {
		++top[k];
		A[k][top[k]] = k, B[k][top[k]] = n;
		int res = 0;
		for (int l = 1, r, t; l <= n; l = r + 1) {
			t = n / l, r = n / t;
			res = (res + t * (r - l + 1ll)) % P;
		}
		return G[k][n] = res;
	}
}

void dfs(int u, int dep) {
	top[dep] = 0; int s = 0;
	d[dep] = u;
	for (int l = 1, r, t, v; l <= min(b, c); l = r + 1) {
		t = b / l, v = c / l, r = min(min(b, c), min(b / t, c / v));
		s = (s + ((LL)f(r, dep) - f(l - 1, dep) + P) * g(t, dep) % P * g(v, dep)) % P;
	}
	
	h[u] = s;
	for (int i = 0; i < e[u].size(); i++) {
		int v = e[u][i];
		dfs(v, dep + 1);
	}
	
	for (int j = 1; j <= top[dep]; j++) 
		F[A[dep][j]][B[dep][j]] = -1, G[A[dep][j]][B[dep][j]] = -1;
}

int main() {
	memset(F, -1, sizeof F);
	memset(G, -1, sizeof G);
	init();
	int T; scanf("%d", &T);
	while (T--) {
		scanf("%d%d%d", &a, &b, &c);
		for (int i = 1; i <= a; i++) vis[i] = false, e[i].clear();
		ans = 0;
		
		for (int i = 1; i <= a; i++) {
			int s = 0; int x = i;
			for (int j = 2; j * j <= x; j++)
		 		while (x % j == 0 && (x / j) % j == 0) x /= j;
			if (!vis[x] && fac[x] > 1) vis[x] = true,  e[x / fac[x]].push_back(x);
			
		}
		
		dfs(1, 0);
		
		for (int i = 1; i <= a; i++) {
			int s = 0; int x = i;
			for (int j = 2; j * j <= x; j++)
		 		while (x % j == 0 && (x / j) % j == 0) x /= j;
		 	ans = (ans + (LL)h[x] * (a / i)) % P;
		}
		
		printf("%d\n", ans);
	}
}