#include <bits/stdc++.h>
using namespace std;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) begin(v),end(v)
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
using ll = long long;
using pii = pair<int, int>;
constexpr ll INF = 1ll<<30;
constexpr ll longINF = 1ll<<60;
constexpr ll MOD = 1000000007;
constexpr bool debug = false;
//---------------------------------//

int main() {
	int T;
	cin >> T;
	while (T--) {
		int D, A, B;
		scanf("%d %d %d", &D, &A, &B);
		auto solve = [](int d, int x) -> ll {
			if (x < 0) return 0;
			ll sum = (ll)(d - 1) * d / 2;
			ll res = sum * ((x - 1) / (d - 1));
			ll r = (x - 1) % (d - 1) + 1;
			res += r * (r + 1) / 2;
			return res;
		};
		cout << solve(D, B) - solve(D, A - 1) << endl;
	}
}