#include <bits/stdc++.h>
#include<atcoder/math>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto&& e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S>
bool chmin(T& a, const S& b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
bool chmax(T& a, const S& b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;
constexpr int MOD=998244353;

struct mod_fac{
  vector <ll> fac,inv,invf;
  mod_fac (int n):
    fac(n),inv(n),invf(n){
    fac[0]=fac[1]=1;
    inv[0]=inv[1]=1;
    invf[0]=invf[1]=1;
    for(int i=2;i<n;i++){
      fac[i]=fac[i-1]*i%MOD;
      inv[i]=inv[MOD%i]*(MOD-MOD/i)%MOD;
      invf[i]=invf[i-1]*inv[i]%MOD;
    }
  }
  ll comb(int n,int r){
    return fac[n]*invf[r]%MOD*invf[n-r]%MOD;
  }
  ll perm(int n,int r){
    return fac[n]*invf[n-r]%MOD;
  }
};

void ch(ll &a,ll b){
  a=(a+b)%MOD;
}

vector<vl> matmul(vector<vl> a,vector<vl> b){
  int n=sz(a);
  vector ret(n,vl(n));
  rep(i,n){
    rep(j,n){
      rep(k,n){
        ch(ret[i][j],a[i][k]*b[k][j]);
      }
    }
  }
  return ret;
}

vector<vl> matpow(vector<vl> a,ll N){
  int n=sz(a);
  vector ret(n,vl(n));
  rep(i,n)ret[i][i]=1;
  while(N>0){
    if(N%2){
      ret=matmul(ret,a);
    }
    a=matmul(a,a);
    N/=2;
  }
  return ret;
}

vl vecmul(vl v,vector<vl> m){
  int n=sz(v);
  vl ret(n);
  rep(i,n)rep(j,n)ch(ret[j],v[i]*m[i][j]);
  return ret;
}

int main(){
  ll K,L,R;
  cin>>K>>L>>R;
  vector mat(K+4,vl(K+4));
  mod_fac F(K+10);
  mat[0][0]=K;
  mat[K+1][0]=1;
  mat[K+2][0]=1;
  mat[K+2][K+2]=K;

  mat[0][K+3]=1;
  mat[K+3][K+3]=1;

  rep(i,K+1){
    rep(j,i+1){
      mat[j+1][i+1]=F.comb(i,j);
    }
  }

  // fore(i,mat){
  //   fore(j,i)cerr<<j<<' ';
  //   cerr<<'\n';
  // }
  auto pR=matpow(mat,R+1);
  auto pL=matpow(mat,L);
  // fore(i,pR){
  //   fore(j,i)cerr<<j<<' ';
  //   cerr<<'\n';
  // }
  // cerr<<endl;
  // fore(i,pL){
  //   fore(j,i)cerr<<j<<' ';
  //   cerr<<'\n';
  // }
  // cerr<<endl;
  ll ans=0;
  ch(ans,pR[0][K+3]);
  ch(ans,pR[1][K+3]);
  ch(ans,pR[K+2][K+3]);
  cerr<<ans<<'\n';
  ch(ans,-pL[0][K+3]);
  ch(ans,-pL[1][K+3]);
  ch(ans,-pL[K+2][K+3]);
  ch(ans,MOD);
  cout<<ans<<'\n';
}