#include <iostream>
#include <cstdio>
using namespace std;
const int N = 1e6+10, mod = 1e9+7;
long long C[N], S[N];
signed main() {
for (int i = 1; i <= 1000000; i ++)
C[i] = (1LL * (i - 1) * (i - 2) / 2) % mod, S[i] = (S[i - 1] + C[i]) % mod;
int t;
cin >> t;
while (t --) {
int x, y;
scanf ("%d%d", &x, &y);
printf ("%lld\n", ((S[y] - S[x - 1]) % mod + mod) % mod);
}
return 0;
}
SP26777
最新推荐文章于 2024-08-08 21:46:59 发布