#include <bits/stdc++.h>
#define mod 1000003
using namespace std;
typedef long int ll;
vector < ll >factoz(mod,1);
ll POW(ll a,ll b){
ll x=1,y=a;
while(b>0){
if(b%2==1){
x=(x*y);
if(x>mod)x%=mod;
}
y=(y*y);
if(y>mod)y%=mod;
b/=2;
}
return x;
}
ll invE(ll n){
return POW(n,mod-2);
}
ll smallcombinatorial(ll n,ll r){
return (factoz[n]*((invE(factoz[r]))*(invE(factoz[n-r]))%mod))%mod;
}
ll combinatorial(ll n,ll r){
if(n==0&&r==0)return 1;
ll ni,ri;
ni=n%mod;
ri=r%mod;
if(ri>ni)return 0;
return combinatorial(n/mod,r/mod)*smallcombinatorial(ni,ri);
}
int main(){
for(ll i=2;i<mod;i++)
factoz[i] = (factoz[i-1]*i)%mod;
int t;scanf("%d",&t);
while(t--){
ll ans=0,n,l,r;
scanf("%ld%ld%ld",&n,&l,&r);
ans=combinatorial(n+r-l+1,min(n,r-l+1))-1;
cout<<ans<<endl;
while(ans<0)ans+=mod;
printf("%ld\n",ans%mod);
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CiNkZWZpbmUgbW9kIDEwMDAwMDMKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKdHlwZWRlZiBsb25nIGludCBsbDsKdmVjdG9yIDwgbGwgPmZhY3Rveihtb2QsMSk7CgpsbCBQT1cobGwgYSxsbCBiKXsKbGwgeD0xLHk9YTsKd2hpbGUoYj4wKXsKCWlmKGIlMj09MSl7CgkJeD0oeCp5KTsKCQlpZih4Pm1vZCl4JT1tb2Q7CgkJfQoJCXk9KHkqeSk7CgkJaWYoeT5tb2QpeSU9bW9kOwoJCWIvPTI7Cgl9CglyZXR1cm4geDsKfQoKbGwgaW52RShsbCBuKXsKcmV0dXJuIFBPVyhuLG1vZC0yKTsJCn0KCmxsIHNtYWxsY29tYmluYXRvcmlhbChsbCBuLGxsIHIpewpyZXR1cm4gKGZhY3RveltuXSooKGludkUoZmFjdG96W3JdKSkqKGludkUoZmFjdG96W24tcl0pKSVtb2QpKSVtb2Q7Cn0KCmxsIGNvbWJpbmF0b3JpYWwobGwgbixsbCByKXsKaWYobj09MCYmcj09MClyZXR1cm4gMTsKbGwgbmkscmk7Cm5pPW4lbW9kOwpyaT1yJW1vZDsKaWYocmk+bmkpcmV0dXJuIDA7CnJldHVybiBjb21iaW5hdG9yaWFsKG4vbW9kLHIvbW9kKSpzbWFsbGNvbWJpbmF0b3JpYWwobmkscmkpOwp9CgppbnQgbWFpbigpewpmb3IobGwgaT0yO2k8bW9kO2krKykKZmFjdG96W2ldID0gKGZhY3RveltpLTFdKmkpJW1vZDsKaW50IHQ7c2NhbmYoIiVkIiwmdCk7CndoaWxlKHQtLSl7CmxsIGFucz0wLG4sbCxyOwpzY2FuZigiJWxkJWxkJWxkIiwmbiwmbCwmcik7CmFucz1jb21iaW5hdG9yaWFsKG4rci1sKzEsbWluKG4sci1sKzEpKS0xOwpjb3V0PDxhbnM8PGVuZGw7CndoaWxlKGFuczwwKWFucys9bW9kOwpwcmludGYoIiVsZFxuIixhbnMlbW9kKTsKfQpyZXR1cm4gMDsJCn0K