#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define SZ(a) ((int)a.size())
#define pb push_back
#define ALL(v) v.begin(), v.end()

const int MOD = 998244353;
const ll INF = 9e18;

ll lgap(ll a, ll x) { // a / b < x, b >= ?
    if (x <= 0) return INF;
    return a / x + 1;
}

ll rgap(ll a, ll x) { // a / b >= x, b <= ?
    if (x <= 0) return INF;
    return a / x;
}

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    ll x, l, r;
    cin >> x >> l >> r;
    //ll cnt = 0, cnt2 = 0;
    ll ans = 0;
    for (ll a = 1; a * (a + 1) * (a + 2) * (a + 3) <= x; ++a) {
        ll xa = x / a;
        for (ll b = a + 1; a * b * (b + 1) * (b + 2) <= x; ++b) {
            ll xab = xa / b;
            ll s = sqrt(xab);
            while (s * s < xab) ++s;
            while (s >= xab / s) --s;
            //cnt += max(0LL, s - b);
            //++cnt2;

            //cerr << a << " " << b << " *****\n";

            // a + b
            if (l <= a + b && a + b < r) {
                ans += (s - b) * 4;
                /*cerr << "Case 1\n";
                for (ll i = b + 1; i <= s; ++i)
                    cerr << i << " " << xab / i << "\n";*/
            }

            // a + c
            {
                ll lft = max(b + 1, l - a);
                ll rgt = min(s, r - a - 1);
                ans += max(0LL, rgt - lft + 1) * 4;
                /*cerr << "Case 2\n";
                for (ll i = lft; i <= rgt; ++i)
                    cerr << i << " " << xab / i << "\n";*/
            }

            // b + c
            {
                ll lft = max(b + 1, l - b);
                ll rgt = min(s, r - b - 1);
                ans += max(0LL, rgt - lft + 1) * 4;
                /*cerr << "Case 3\n";
                for (ll i = lft; i <= rgt; ++i)
                    cerr << i << " " << xab / i << "\n";*/
            }

            // a + d
            {
                ll lft = max(lgap(xab, r - a), b + 1);
                ll rgt = min(rgap(xab, l - a), s);
                ans += max(0LL, rgt - lft + 1) * 4;
                /*cerr << "Case 4\n";
                for (ll i = lft; i <= rgt; ++i)
                    cerr << i << " " << xab / i << "\n";*/
            }

            // b + d
            {
                ll lft = max(lgap(xab, r - b), b + 1);
                ll rgt = min(rgap(xab, l - a), s);
                ans += max(0LL, rgt - lft + 1) * 4;
                /*cerr << "Case 5\n";
                for (ll i = lft; i <= rgt; ++i)
                    cerr << i << " " << xab / i << "\n";*/
            }

            // c + d
            {
                ll lft, rgt;

                if ((b + 1) + xab / (b + 1) < l) rgt = b;
                else {
                    ll p = b + 1, q = s + 1;
                    while (q - p > 1) {
                        ll mid = (p + q) / 2;
                        if (mid + xab / mid >= l) p = mid;
                        else q = mid;
                    }
                    rgt = p;
                }

                if (s + xab / s >= r) lft = s + 1;
                else {
                    ll p = b, q = s;
                    while (q - p > 1) {
                        ll mid = (p + q) / 2;
                        if (mid + xab / mid < r) q = mid;
                        else p = mid;
                    }
                    lft = q;
                }

                ans += max(0LL, rgt - lft + 1) * 4;
                /*cerr << "Case 6\n";
                for (ll i = lft; i <= rgt; ++i)
                    cerr << i << " " << xab / i << "\n";*/
            }
        }
    }
    //cout << cnt << "\n"; // 76377704980
    //cout << cnt2 << "\n"; // 9950107 

    cout << ans % MOD << "\n";
}