constint N = 1e6 + 5; constint p = 1e6 + 3; int n, l, r, a[p + 5];
intfpow(int a, int b){ int res = 1; for (; b; b >>= 1, a = a * 1ll * a % p) if (b & 1) res = res * 1ll * a % p; return res; } intC(int n, int m){ if (m > n) return0; return a[n] * 1ll * fpow(a[n - m], p - 2) % p * 1ll * fpow(a[m], p - 2) % p; } intsolve(int n, int m){ if (m == 0) return1; returnsolve(n / p, m / p) * 1ll * C(n % p, m % p) % p; }
intmain(){ int -; a[0] = 1; for (int i = 1; i <= p; i++) a[i] = a[i - 1] * 1ll * i % p; for (scanf("%d", &-); -; ---) { scanf("%d %d %d", &n, &l, &r); printf("%lld\n", (solve(r - l + 1 + n, n) * 1ll - 1ll + p) % p); } return0; }