void solve() {
    int T, k, l1, r1, l2, r2;
    cin >> k >> l1 >> r1 >> l2 >> r2;
    int sum = 0, k_n = 1;
    for (int i = 0; r2 / k_n >= l1; i++) {
        sum += max(0ll, min(r1, r2 / k_n) - max(l1, (l2 - 1) / k_n + 1) + 1);
        k_n *= k;
    }
    cout << sum << endl;
}