WA 19 pts 求调（宣贯）

#include<bits/stdc++.h>
#define int long long
#define MOD 998244353
using namespace std;
int mypow(int x){
    return (1LL<<x);
}
int L,R,l,r;
int solve(int n){
    int ans=0;
    for(int i=1;i<=__lg(n)+1;i++){
        l=mypow(i-1),r=min(mypow(i)-1,n);
        ans+=(2*n-l-r+2)*(r-l+1)*i/2;
    }
    return ans;
}
void work(){
    cin>>L>>R;
    cout<<solve(R)%MOD-solve(L-1)%MOD<<endl;
}
signed main(){
    int T=1;
    cin>>T;
    while(T--) work();
}