#include <bits/stdc++.h>

#define ll long long

#define inf 0x3f3f3f3f

#define il inline

#define int long long

namespace io {

    #define in(a) a=read()

    #define out(a) write(a)

    #define outn(a) out(a),putchar('\n')

    #define I_int int

    inline I_int read() {

        I_int x =  , f =  ; char c = getchar() ;

        while( c < '' || c > '' ) { if( c == '-' ) f = - ; c = getchar() ; }

        while( c >= '' && c <= '' ) { x = x *  + c - '' ; c = getchar() ; }

        return x * f ;

    }

    char F[  ] ;

    inline void write( I_int x ) {

        if( x ==  ) { putchar( '' ) ; return ; }

        I_int tmp = x >  ? x : -x ;

        if( x <  ) putchar( '-' ) ;

        int cnt =  ;

        while( tmp >  ) {

            F[ cnt ++ ] = tmp %  + '' ;

            tmp /=  ;

        }

        while( cnt >  ) putchar( F[ -- cnt ] ) ;

    }

    #undef I_int

}

using namespace io ;

using namespace std ;

#define N 100010

int a1 , l , r , k , p , m ;

struct matrix {

    int m[][] ;

    matrix() { memset(m,,sizeof(m)); }

    matrix operator * (const matrix &x) {

        matrix ans;

        for(int i =  ; i <  ; i ++) {

            for(int j =  ; j <  ; j ++) {

                for(int k =  ; k <  ; k ++) {

                    ans.m[i][j] = (ans.m[i][j] + m[i][k] * x.m[k][j]) % p ;

                }

            }

        }

        return ans ;

    }

} base , ans ;

void power(int b) {

    base.m[][] = base.m[][] = base.m[][] =  ; base.m[][] =  ;

    ans.m[][] = ans.m[][] =  ; ans.m[][] = ans.m[][] =  ;

    while(b) {

        if(b&) ans = ans * base ;

        base = base * base ;

        b >>= ;

    }

}

int x , y ;

int exgcd(int a , int b) {

    if(b == ) { x =  ; y =  ; return a ; }

    int Ans = exgcd(b , a % b) , t = x ;

    x = y ; y = t - (a / b) * y ;

    return Ans ;

}

int find(int x , int t) {

    int l =  , r = t / p +  ;

    while(l <= r) {

        int mid = (l + r) >>  ;

        if(x + p * mid >= t) r = mid -  ;

        else l = mid +  ;

    }

    return l ;

}

signed main() {

    int T = read() ;

    while(T--) {

        a1 = read() , l = read() , r = read() , k = read() , p = read() , m = read() ;

        a1 %= p ; power(k - ) ;

        int mod = (m - a1 * ans.m[][] % p + p) % p ;

        int gcd = exgcd(ans.m[][] , p) ;

        if(mod % gcd != ) { puts("") ; continue ; }

        x = x * (mod/gcd) ; p /= gcd ; x = (x % p + p) % p ;

        outn( find(x , r+) - find(x , l) ) ;

    }

}