#include <bits/stdc++.h>
using namespace std;
typedef long long LL;
const int mod = 1e9+7;
const int N = 1010;
int fac[20] , tot , all ;

struct Matrix {
    LL v[50][50] ;
    Matrix(){ memset( v,0,sizeof v); }
    Matrix operator * ( const Matrix &a ) const {
        Matrix res ;
        for( int i = 0 ; i < all ; ++i )
            for( int k = 0 ; k < all ; ++k ) {
                if( v[i][k] == 0 ) continue ;
                for( int j = 0 ; j < all ; ++j ) {
                    res.v[i][j] = ( res.v[i][j] + v[i][k] * a.v[k][j] % mod )% mod;
                }
            }
        return res;
    }
};

Matrix q_pow( Matrix a , int b ) {
    Matrix res = a ;
    b--;
    while( b ) {
        if( b&1 ) res = res * a ;
        a = a * a ;
        b >>= 1 ;
    }
    return res ;
}

void Work( int d ) {
    tot = 0 ;
    for( int i = 2 ; i * i <= d ; ++i ) {
        if( d % i == 0 ) {
            fac[tot++] = 1 ;
            while( d % i == 0 ) fac[tot-1] *= i , d /= i ;
        }
    }
    if( d > 1 ) fac[tot++] = d ;
}

int main() {
//    freopen("in.txt","r",stdin);
    int _ ; cin >> _ ;
    while( _-- ) {
        int n , m , l , r ;
        LL ans = 0 ;
        cin >> n >> m >> l >> r ;
        for( int d = l ; d <= r ; ++d ) {
            Work(d);  Matrix a ;
            all = 1<<tot ;
            for( int i = 0 ; i < all ; ++i ) {
                for( int j = 1 ; j <= m ; ++j ) {
                    int st = i ;
                    for( int k = 0 ; k < tot ; ++k ) {
                        if( j % fac[k] == 0 ) st |= (1<<k) ;
                    }
                    a.v[i][st]++;
                }
            }
            a = q_pow(a,n);
            ans = ( ans + a.v[0][all-1] ) % mod ;
        }
        cout << ans << endl ;
    }
}