#include #include using namespace std; using namespace atcoder; typedef long long int ll; typedef long double ld; typedef vector vi; typedef vector vvi; typedef vector vvvi; typedef vector vvvvi; typedef vector vb; typedef vector vvb; typedef vector vvvb; typedef vector vvvvb; typedef pair pi; typedef pair ppi; typedef pair pppi; typedef pair ppppi; #define FOR(i,l,r) for(ll i=l;i=l;i--) #define RREP(i,n) RFOR(i,0,n) #define ALL(x) x.begin(),x.end() #define F first #define S second #define BS(A,x) binary_search(ALL(A),x) #define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin()) #define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin()) #define COU(A,x) (UB(A,x)-LB(A,x)) #define sz(c) ((ll)(c).size()) /* #include namespace mp=boost::multiprecision; using Bint=mp::cpp_int; */ templateusing min_priority_queue=priority_queue,greater>; templateostream&operator<<(ostream&os,pair&p){os<istream&operator>>(istream&is,pair&p){is>>p.F>>p.S;return is;} templateostream&operator<<(ostream&os,vector&v){REP(i,sz(v))os<istream&operator>>(istream&is,vector&v){for(T&in:v)is>>in;return is;} templatebool chmax(T&a,T b){if(abool chmin(T&a,T b){if(b(a,b); auto y=convolution(a,b); auto z=convolution(a,b); vectorret(sz(a)+sz(b)-1); REP(i,sz(ret)){ ll v1=(y[i]-x[i])*m1_inv_m2%m2;if(v1<0)v1+=m2; ll v2=(z[i]-(x[i]+m1*v1)%m3)*m12_inv_m3%m3;if(v2<0)v2+=m3; ret[i]=(x[i]+m1*v1+m12_mod*v2)%mod; } return ret; } const ld EPS=1e-8; //* using mint=modint998244353; const ll mod=998244353; //*/ /* using mint=modint1000000007; const ll mod=1000000007; //*/ //using mint=modint; //* typedef vector vm; typedef vector vvm; typedef vector vvvm; typedef vector vvvvm; ostream&operator<<(ostream&os,mint&a){os<>N>>M; if(N%2){cout<<0<>L>>R; if((R-L)%2)D.emplace_back(R-L+1); } M=sz(D); sort(ALL(D)); vm K(1e7,1),R(1e7),C(1e7); FOR(i,1,1e7)K[i]=i*K[i-1]; REP(i,1e7)R[i]=1/K[i]; REP(i,1e6)C[i]=K[2*i]*R[i]*R[i+1]; sort(ALL(D)); vvm E(M+1); REP(i,M){ E[i].resize(D[i]/2+1); E[i][0]=1; E[i][D[i]/2]=-C[D[i]/2]; } E[M]=vm{1}; while(sz(E)>1){ vvm F; REP(i,sz(E)/2)F.emplace_back(convolution(E[2*i],E[2*i+1])); if(sz(E)%2)F.emplace_back(E.back()); E=F; } mint ans=0; REP(i,sz(E[0]))ans+=C[N/2-i]*E[0][i]; cout<