一本通1657：序列统计

#include <bits/stdc++.h>
using namespace std;
const int N = 110;
typedef long long ll;
const int mod = 1e6 + 3;
ll n, m, r, l, t;
ll fact[mod + 2];

ll qmi(ll a, ll b) {
    ll res = 1;

    while (b) {
        if (b & 1)
            res = res * a % mod;

        a = a * a % mod;
        b >>= 1;
    }

    return res;
}

ll C(ll a, ll b) {
    if (a < b)
        return 0;

    return fact[a] * qmi(fact[b], mod - 2) * qmi(fact[a - b], mod - 2) % mod;
}

ll lucas(ll a, ll b) {
    if (b == 0)
        return 1;

    return C(a % mod, b % mod) % mod * lucas(a / mod, b / mod) % mod;
}

int main() {
    cin >> t;
    fact[0] = 1;

    for (int i = 1; i <= mod; i++)
        fact[i] = fact[i - 1] * i % mod;

    while (t--) {
        cin >> n >> l >> r;
        ll m = r - l + 1;
        cout << (lucas(n + m, m) - 1 + mod) % mod << endl;
    }

    return 0;
}