#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define all(x) ((x).begin()), ((x).end())
typedef long long LL;
const LL mod = 998244353;
LL a[4], b[4];
inline LL min_denom(LL a, LL c) {
	return c >= 0 ? a / (c + 1) + 1 : mod * mod;
}
inline LL intsq(LL x) {
	LL res = LL(sqrt(x));
	while(res * res > x) {
		res--;
	}
	while((res + 1) * (res + 1) <= x) {
		res++;
	}
	return res;
}
LL calc(LL X, LL R) {
	LL res = 0;
	auto calc = [&]() {
		memcpy(b, a, sizeof(b));
		do {
			if(b[0] + b[1] < R) {
				res++;
			}
		} while(next_permutation(b, b + 4)); 
		res %= mod;
	};
	for(a[0] = 1; a[0] <= 3162; a[0]++) {
		//cout << a[0] << endl;
		for(a[1] = a[0] + 1; a[0] * a[1] * a[1] * a[1] <= X; a[1]++) {

			//cout << a[0] << ' ' << a[1] << ':' << res << endl;
			LL cmin = a[1] + 1, cmax = intsq(X / a[0] / a[1]);
			//cout << cmin << '?' << cmax << endl;
			if(cmax == X / a[0] / a[1] / cmax) {
				cmax--;
			}
			if(cmin > cmax) continue;
			/*a[2] = cmin;
			a[3] = X / a[0] / a[1] / a[2];
			calc();
			if(cmax > cmin) {
				a[2] = cmax;
				a[3] = X / a[0] / a[1] / a[2];
				calc();
			}
			cmin++;
			cmax--;
			if(cmin > cmax) continue;*/
			if(a[0] != a[1]) {
				if(a[0] + a[1] < R) {
					res = (res + (cmax - cmin + 1) * 4) % mod;
				}
				LL rm = R - a[0] - 1;
				rm = min(rm, cmax);
				if(rm >= cmin) {
					res = (res + (rm - cmin + 1) * 4) % mod;
				}
				rm = R - a[1] - 1;
				rm = min(rm, cmax);
				if(rm >= cmin) {
					res = (res + (rm - cmin + 1) * 4) % mod;
				}
				rm = min_denom(X / a[0] / a[1], R - a[0] - 1);
				rm = max(rm, cmin);
				if(rm <= cmax) {
					res = (res + (cmax - rm + 1) * 4) % mod;
				}
				rm = min_denom(X / a[0] / a[1], R - a[1] - 1);
				rm = max(rm, cmin);
				if(rm <= cmax) {
					res = (res + (cmax - rm + 1) * 4) % mod;
				}
				LL le = cmin, ri = cmax + 1;
				while(le != ri) {
					LL mid = (le + ri) / 2;
					if(mid + X / a[0] / a[1] / mid < R) {
						ri = mid;
					}else {
						le = mid + 1;
					}
				}
				res = (res + (cmax - le + 1) * 4) % mod;
			}else {
				assert(false);
				if(a[0] + a[1] < R) {
					res = (res + (cmax - cmin + 1) * 2) % mod;
				}
				LL rm = R - a[0] - 1;
				rm = min(rm, cmax);
				if(rm >= cmin) {
					res = (res + (rm - cmin + 1) * 4) % mod;
				}
				//cout << "rm = " << rm << ' ' << res << endl;
				
				rm = min_denom(X / a[0] / a[1], R - a[0] - 1);
				cout << X / a[0] / a[1] << '?' << R - a[0] - 1 << '?' << rm << endl;
				rm = max(rm, cmin);
				if(rm <= cmax) {
					res = (res + (cmax - rm + 1) * 4) % mod;
				}
				//cout << "rm = " << rm << ' ' << res << endl;
				
				LL le = cmin, ri = cmax + 1;
				while(le != ri) {
					LL mid = (le + ri) / 2;
					if(mid + X / a[0] / a[1] / mid < R) {
						ri = mid;
					}else {
						le = mid + 1;
					}
				}
				///cout << "le = " << le << ' ' << res << endl;
				res = (res + (cmax - le + 1) * 2) % mod;
			}
		}
	}
	//cout << "res = " << res << endl;

	if(false) {
		int rr = 0;
		for(a[0] = 1; a[0] <= X; a[0]++) {
		for(a[1] = 1; a[1] <= X; a[1]++) {
		for(a[2] = 1; a[2] <= X; a[2]++) {
		for(a[3] = 1; a[3] <= X; a[3]++) {
			if(a[0] * a[1] * a[2] * a[3] <= X && 
			(a[0] + 1) * a[1] * a[2] * a[3] > X && 
			(a[0] + 0) * (a[1] + 1) * a[2] * a[3] > X && 
			(a[0] + 0) * (a[1] + 0) * (a[2] + 1) * a[3] > X && 
			(a[0] + 0) * (a[1] + 0) * (a[2] + 0) * (a[3] + 1) > X && 
			a[0] + a[1] < 6 && a[0] + a[1] >= 5) {
				printf("%d %d %d %d\n", a[0], a[1], a[2], a[3]);
				rr++;
			}
		}
		}
		}
		}
		cout << rr << "vs " << res << endl;
	}
	return res;
}
int main() {
	LL X, L, R;
	cin >> X >> L >> R;
	cout << ((calc(X, R) - calc(X, L) + mod)) % mod << endl;
}