#include <iostream>
#include <cstdio>
using namespace std ;
typedef long long LL;
const int mod = 1e9+7;
const int N = 10000100;
LL A[N] ;
LL q_pow( LL a , LL b ) {
    LL res = 1 ;
    while( b ) {
        if( b&1 ) res =  res * a  % mod ;
        a = a * a % mod ;
        b >>= 1;
    }
    return res ;
}
int main() {
//    freopen("in.txt","r",stdin);
    int _ ; cin >> _ ;
    while( _-- ) {
        LL n , m , l , r ;
        cin >> n >> m >> l >> r ;
        for( int d = m ; d >= l ; --d ) {
            if( d == m || m/d != m/(d+1) ) A[d] = q_pow( m/d , n );
            else A[d] = A[d+1] ;
        }
        for( int i = m ; i >= l ; --i ) {
            for( int j = i + i ; j <= m ; j += i ) {
                A[i] =( ( A[i] - A[j] ) % mod + mod ) % mod ;
            }
        }
        LL ans = 0 ;
        for( int i = l ; i <= r ; ++i )
            ans = ( ans + A[i] ) % mod ;
        cout << ans << endl ;
    }
}