#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const ll modc = 998244353;
class mint {
    ll x;
public:
    mint(ll x=0) : x((x%modc+modc)%modc) {}
    mint operator-() const {
      return mint(-x);
    }
    mint& operator+=(const mint& a) {
        if ((x += a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator-=(const mint& a) {
        if ((x += modc-a.x) >= modc) x -= modc;
        return *this;
    }
    mint& operator*=(const  mint& a) {
        (x *= a.x) %= modc;
        return *this;
    }
    mint operator+(const mint& a) const {
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const {
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const {
        mint res(*this);
        return res*=a;
    }
    mint pow(ll t) const {
        if (!t) return 1;
        mint a = pow(t>>1);
        a *= a;
        if (t&1) a *= *this;
        return a;
    }
    mint inv() const {
        return pow(modc-2);
    }
    mint& operator/=(const mint& a) {
        return (*this) *= a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    bool operator == (const mint& a) const{
        return x == a.x;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    friend istream& operator>>(istream& ip, mint &m) {
        ll t;
        ip >> t;
        m = mint(t);
        return ip;
    }
};

mint a;

//sum (i=0 to A) floor(i/B)
mint floor_sum(ll A, ll B){
    if (A < 0) return 0;
    ll q = A/B, r = A % B;
    return mint(B) * (q-1) * q * a + mint(q) * (r+1);
}

int main(){

    int T;
    cin >> T;
    ll N, M, L, R;
    a = mint(2).inv();

    while(T){
        T--;
        cin >> N >> M >> L >> R;
        mint ans = R-L+1;

        ans += floor_sum(R, N-1);
        ans -= floor_sum(L-1, N-1);
        ans += floor_sum(M-L, N-1);
        ans -= floor_sum(M-R-1, N-1);

        cout << ans << '\n';
    }

    return 0;
}