#include <set>

 #include <map>

 #include <deque>

 #include <queue>

 #include <stack>

 #include <cmath>

 #include <ctime>

 #include <bitset>

 #include <cstdio>

 #include <string>

 #include <vector>

 #include <cstdlib>

 #include <cstring>

 #include <iostream>

 #include <algorithm>

 using namespace std;

 typedef long long LL;

 typedef pair<LL, LL> pLL;

 typedef pair<LL, int> pLi;

 typedef pair<int, LL> pil;;

 typedef pair<int, int> pii;

 typedef unsigned long long uLL;

 #define lson rt<<1

 #define rson rt<<1|1

 #define lowbit(x) x&(-x)

 #define name2str(name) (#name)

 #define bug printf("*********\n")

 #define debug(x) cout<<#x"=["<<x<<"]" <<endl

 #define FIN freopen("D://code//in.txt","r",stdin)

 #define IO ios::sync_with_stdio(false),cin.tie(0)

 const double eps = 1e-;

 const int mod = ;

 const int maxn = 2e5 + ;

 const double pi = acos(-);

 const int inf = 0x3f3f3f3f;

 const LL INF = 0x3f3f3f3f3f3f3f3fLL;

 int t;

 LL l, r, k, m;

 int main(){

     scanf("%d", &t);

     while(t--) {

         scanf("%lld%lld%lld%lld", &l, &r, &k, &m);

         int flag = ;

         LL ans = , tmp = ;

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

             if(r / tmp < k) {

                 flag = ;

                 break;

             }

             tmp = tmp * k;

         }

         if(!flag) {

             printf("0\n");

             continue;

         }

         ans = r / tmp - (l - ) / tmp;

         if(r / tmp >= k) {

             tmp = tmp * k;

             ans -= r / tmp - (l - ) / tmp;

         }

         printf("%lld\n", ans);

     }

     return ;

 }