2019杭电多校 permutation2

Problem:http://acm.hdu.edu.cn/contests/contest_showproblem.php?pid=1007&cid=852

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
ll d[];
void f()
{
    d[]=d[]=d[]=;
    for(int i=;i<=;i++) d[i]=(d[i-]+d[i-])%;
}
int main()
{
    f();int t;scanf("%d",&t);
    while(t--)
    {
        ll n,x,y;
        scanf("%lld%lld%lld",&n,&x,&y);
        if(x==&&y==n) printf("%d\n",d[n]);
        else if(x==)  printf("%d\n",d[y-]);
        else if(y==n)  printf("%d\n",d[n-x]);
        else            printf("%d\n",d[y-x-]);
    }
    return ;
}