#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

// using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint998244353;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

// 行列累乗ライブラリ
// m_mul と p_mul を同時にインポートする

vector<vector<mint>> m_mul(vector<vector<mint>> &a, vector<vector<mint>> &b) {
    ll n = a.size();
    vector<vector<mint>> ret(n, vector<mint>(n, 0));
    for (ll i = 0; i < n; i++) {
        for (ll j = 0; j < n; j++) {
            for (ll k = 0; k < n; k++) {
                ret[i][j] = (ret[i][j] + a[i][k] * b[k][j]);
            }
        }
    }
    return ret;
}

vector<vector<mint>> p_mul(vector<vector<mint>> a, ll k) {
    ll n = a.size();
    vector<vector<mint>> ret(n, vector<mint>(n, 0));
    for (ll i = 0; i < n; i++) {
        ret[i][i] = mint(1);
    }
    while (k > 0) {
        if (k % 2 == 1) {
            ret = m_mul(a, ret);
        }
        a = m_mul(a, a);
        k /= 2;
    }
    return ret;
}

int main() {
    ll K, L, R;
    cin >> K >> L >> R;
    vector<vector<mint>> M(K + 4, vector<mint>(K + 4, mint(0)));

    M[0][0] = mint(1);
    M[0][1] = mint(K);
    M[0][2] = mint(1);
    M[0][3] = mint(1);

    M[1][1] = mint(K);
    M[1][2] = mint(1);
    M[1][3] = mint(1);

    M[2][2] = mint(K);

    vector<vector<mint>> comb(K + 1, vector<mint>(K + 1));
    for (ll i = 0; i <= K; i++) {
        comb[i][0] = mint(1);
        comb[i][i] = mint(1);
    }
    for (ll i = 2; i <= K; i++) {
        for (ll j = 1; j < i; j++) {
            comb[i][j] = comb[i - 1][j - 1] + comb[i - 1][j];
        }
    }
    for (ll i = 3; i < K + 4; i++) {
        for (ll j = i; j < K + 4; j++) {
            ll n = K + 3 - i;
            ll r = K + 3 - j;
            M[i][j] = comb[n][r];
        }
    }
    // debug_mint2(M);
    mint ans = 0;
    vector<vector<mint>> pow_m = p_mul(M, R);
    ans += (pow_m[0][0] + pow_m[0][1] + pow_m[0][2] + pow_m[0][K + 3]);
    if (L > 0) {
        vector<vector<mint>> pow_m2 = p_mul(M, L - 1);
        ans -= (pow_m2[0][0] + pow_m2[0][1] + pow_m2[0][2] + pow_m2[0][K + 3]);
    }
    cout << ans.val() << endl;
}