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

using Int = long long;

template <class T> void pv(T a, T b) {
  for (T i = a; i != b; ++i) cerr << *i << " ";
  cerr << endl;
}
template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &p) {
  return os << "(" << p.first << ", " << p.second << ")";
}

// maroon shakyou-modint
using ll=long long;
const uint mod=998244353;
struct mint{
  uint v;
  mint(ll vv=0){s(vv%mod+mod);}
  mint& s(uint vv){
    v=vv<mod?vv:vv-mod;
    return *this;
  }
  mint operator-()const{return mint()-*this;}
  mint&operator+=(mint r){return s(v+r.v);}
  mint&operator-=(mint r){return s(v+mod-r.v);}
  mint&operator*=(mint r){v=(unsigned ll)v*r.v%mod;return *this;}
  mint&operator/=(mint r){return *this*=r.inv();}
  mint operator+(mint r)const{return mint(*this)+=r;}
  mint operator-(mint r)const{return mint(*this)-=r;}
  mint operator*(mint r)const{return mint(*this)*=r;}
  mint operator/(mint r)const{return mint(*this)/=r;}
  mint pow(ll n)const{
    if(n<0)return inv().pow(-n);
    mint res(1),x(*this);
    while(n){
      if(n&1)res*=x;
      x*=x;
      n>>=1;
    }
    return res;
  }
  mint inv()const{return pow(mod-2);}
};

ostream &operator<<(ostream &os, mint a) {
  return os << a.v;
}


mint solve(const Int X, const Int R) {
  mint ans = 0;
  for (Int a = 1; a*(a+1)*(a+2)*(a+3) <= X; ++a) {
    for (Int b = a + 1; a * b*(b+1)*(b+2) <= X; ++b) {
      const Int y = X / (a * b);
      Int lb = b + 1;
      Int ub = sqrt((long double)y);
      for (; ub * (ub + 1) > y; --ub) {}
      
      auto add = [&](Int c0, Int c1) -> void {
// if(X<=30)cerr<<a<<" "<<b<<": ["<<c0<<", "<<c1<<"]"<<endl;
        if (c0 <= c1) {
          ans += (c1 - c0 + 1);
        }
      };
      
      // a+b
      if (a + b < R) add(lb, ub);
      // a+c, b+c
      add(lb, min(ub, R - a - 1));
      add(lb, min(ub, R - b - 1));
      // a+d, b+d
      if (R - a > 0) add(max(lb, y / (R - a) + 1), ub);
      if (R - b > 0) add(max(lb, y / (R - b) + 1), ub);
      // c+d
      Int lo = lb - 1, hi = ub + 1;
      for (; lo + 1 < hi; ) {
        const Int mid = (lo + hi) / 2;
        ((mid + y / mid < R) ? hi : lo) = mid;
      }
      add(hi, ub);
    }
  }
  return ans;
}

int main() {
  Int X, L, R;
  for (; ~scanf("%lld%lld%lld", &X, &L, &R); ) {
    mint ans = 0;
    ans += solve(X, R);
    ans -= solve(X, L);
    ans *= 4;
    printf("%u\n", ans.v);
  }
  return 0;
}