#include<bits/stdc++.h>

using namespace std;

#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define pf push_front
#define LC k<<1
#define RC k<<1|1
#define IO cin.sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define rep(i, a, n) for (int i = a; i < n; i++)
#define repn(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = (n) - 1; i >= a; i--)
#define pern(i, a, n) for (int i = n; i >= a; i--)

typedef long long LL;
typedef long double LD;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef pair<int, LL> PIL;
typedef pair<LL, int> PLI;
typedef pair<double, double> PDD;
typedef pair<ull, ull> PUU;
typedef pair<LL, LL> PLL;

const int N = 110000;
const int M = 1100000;
const int mod = 998244353;
const int inf = (int)1e9;
const LL INF = 1e18;
const double eps = 1e-9;

mt19937_64 Rand((unsigned long long)new char);
#define rand Rand

LL x, l, r;
LL cal(LL v) {
	LL res = 0;
	for (LL b = 1; b * (b + 1) * (b + 2) <= x; b++) {
		LL va = min(x / (b * (b + 1) * (b + 2)), b - 1);
		for (LL a = 1; a <= va; a++) {
			LL lim = x / (a * b);
			LL l = b + 1, r = sqrtl(lim);
			while ((r + 1) * (r + 2) <= lim) r++;
			while (r * (r + 1) > lim) r--;
			if (l > r) continue;
			// AB
			if (a + b <= v) res = (res + r - l + 1) % mod;
			// AC
			if (l <= min(r, v - a)) res = (res + min(r, v - a) - l + 1) % mod;
			// AD
			if (a + lim / r <= v) {
				LL ll = l, rr = r, pos;
				while (ll <= rr) {
					LL mid = (ll + rr) / 2;
					if (a + lim / mid <= v) rr = mid - 1, pos = mid;
					else ll = mid + 1;
				}
				res = (res + r - pos + 1) % mod;
			}
			// BC
			if (l <= min(v - b, r)) res = (res + min(v - b, r) - l + 1) % mod;
			// BD
			if (b + lim / r <= v) {
				LL ll = l, rr = r, pos;
				while (ll <= rr) {
					LL mid = (ll + rr) / 2;
					if (b + lim / mid <= v) rr = mid - 1, pos = mid;
					else ll = mid + 1;
				}
				res = (res + r - pos + 1) % mod;
			}
			// CD
			if (lim / r + r <= v) {
				LL ll = l, rr = r, pos;
				while (ll <= rr) {
					LL mid = (ll + rr) / 2;
					if (mid + lim / mid <= v) rr = mid - 1, pos = mid;
					else ll = mid + 1;
				}
				res = (res + r - pos + 1) % mod;
			}
		}
	}
	return res;
}
int main() {
	IO;
	cin >> x >> l >> r;
	LL ans = (cal(r - 1) - cal(l - 1) + mod) % mod * 4 % mod;
	cout << ans << "\n";
	return 0;
}