#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<vvl> vvvl;
typedef vector<vvvl> vvvvl;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<vvb> vvvb;
typedef vector<vvvb> vvvvb;
typedef pair<ll,ll> pl;
typedef pair<ll,pl> ppl;
typedef pair<ll,ppl> pppl;
typedef pair<ll,pppl> pppppl;
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define rrep(i,a,b) for(int i=(b)-1;i>=(a);i--)
#define all(a) begin(a),end(a)
#define sz(a) (int)(a).size()
#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) (ll)(upper_bound(all(A),x)-lower_bound(all(A),x))
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
template<class T>bool chmax(T&a,T b){if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T&a,T b){if(b<a){a=b;return 1;}return 0;}
//*
using mint=modint998244353;
const ll mod=998244353;
//*/
/*
using mint=modint1000000007;
const ll mod=1000000007;
//*/
//using mint=modint;
//*
typedef vector<mint> vm;
typedef vector<vm> vvm;
typedef vector<vvm> vvvm;
typedef vector<vvvm> vvvvm;
ostream&operator<<(ostream&os,mint a){os<<a.val();return os;}
istream&operator>>(istream&is,mint&a){int x;is>>x;a=mint(x);return is;}
//*/
template<typename T1,typename T2>ostream&operator<<(ostream&os,pair<T1,T2>p){os<<p.F<<" "<<p.S;return os;}
template<typename T1,typename T2>istream&operator>>(istream&is,pair<T1,T2>&p){is>>p.F>>p.S;return is;}
template<typename T>ostream&operator<<(ostream&os,vector<T>v){rep(i,0,sz(v))os<<v[i]<<(i+1!=sz(v)?" ":"");return os;}
template<typename T>istream&operator>>(istream&is,vector<T>&v){for(T&in:v)is>>in;return is;}
#include<bits/stdc++.h>
using namespace std;
template<typename T>
T interpolation(vector<T>&X,vector<T>&Y,T x){
	assert(X.size()==Y.size());
	int N=X.size();
	T ans=0;
	rep(i,0,N){
		T a=Y[i];
		rep(j,0,N)if(i!=j)a*=x-X[j],a/=X[i]-X[j];
		ans+=a;
	}
	return ans;
}
vm inv(const vm&f){
  vm g{1/f[0]};
  while(sz(g)<sz(f)){
    vm x(f.begin(),f.begin()+min(sz(f),2*sz(g)));
    x=convolution(x,convolution(g,g));
    g.resize(2*sz(g));
    rep(i,sz(g)/2,min(sz(x),sz(g)))g[i]-=x[i];
  }
  return {g.begin(),g.begin()+sz(f)};
}
template<typename T>
pair<vector<T>,vector<T>>div(vector<T>f,const vector<T>&g){
    if(f.size()<g.size())return make_pair(vector<T>(0),f);
    reverse(f.begin(),f.end());
    vector<T>h=g;
    reverse(h.begin(),h.end());
    while(h.size()+g.size()<=f.size())h.emplace_back(0);
    vector<T>q=convolution(f,inv(h));
    q.resize(f.size()-g.size()+1);
    reverse(q.begin(),q.end());
    auto r=convolution(g,q);
    reverse(f.begin(),f.end());
    for(int i=0;i<f.size();i++)r[i]=f[i]-r[i];
    while(!r.empty()&&r.back()==T(0))r.erase(r.end()-1);
    return make_pair(q,r);
}
int main(){
  cin.tie(0)->sync_with_stdio(0);
  cin.exceptions(cin.failbit);
  ll K,L,R;cin>>K>>L>>R;
  
  vm B(K+10);
  rep(i,1,K+10)B[i]=B[i-1]+pow_mod(i,K,mod);
  vm A(K+10);
  iota(all(A),0);
  
  vm C(K+10);
  rep(i,0,K+10)C[i]=pow_mod(i,K,mod);
  rep(_,0,K+1)rrep(i,1,K+10)C[i]-=C[i-1];
  
  vm D(K+3);
  D[0]=1;
  rep(_,0,K+1)rrep(i,0,_+1)D[i+1]-=D[i];
  rrep(i,0,K+2)D[i+1]-=K*D[i];
  vm g(K+3,1);
  rep(i,0,K+3)g[i]=D[K+2-i];
  
  auto ID=inv(D);
  vvm T(60);
  T[0]=vm{0,1};
  rep(i,1,60)T[i]=div(convolution(T[i-1],T[i-1]),g).second;
  auto eval=[&](ll N)->mint{
  	vm rd=vm{1};
  	rep(i,0,60)if((N>>i)%2)rd=div(convolution(rd,T[i]),g).second;
  	mint ans=0;
  	rep(i,0,sz(rd))ans+=ID[i]*rd[i];
  	return ans;
  };
  auto f=[&](ll N)->mint{
  	if(N<0)return 0;
  	mint ans=0;
  	if(N>1){
  		mint n=N;
  		if(K==1)ans=(n+1)*n*(n-1)/6;
  		else{
  			mint r=inv_mod(K-1,mod),s=0;
  			rep(i,0,sz(C))if(N-1-i>=0)s+=C[i]*eval(N-1-i);
  			ans=r*(K*s-interpolation(A,B,mint(N-1)));
  		}
  	}
  	if(K==1)ans+=(N%mod+2)*(N%mod+1)%mod*((mod+1)/2);
  	else{
  		mint r=inv_mod(1-K,mod);
  		ans+=(1-pow_mod(K,N,mod)*(K+N%mod)+(1-pow_mod(K,N,mod))*r)*r;
  	}
  	return ans;
  };
  cout<<f(R)-f(L-1)<<endl;
  return 0;
}