/*

 * Author    : ben

 */

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <cmath>

#include <ctime>

#include <iostream>

#include <algorithm>

#include <queue>

#include <set>

#include <map>

#include <stack>

#include <string>

#include <vector>

#include <deque>

#include <list>

#include <functional>

#include <numeric>

#include <cctype>

using namespace std;

typedef long long LL;

LL three[];

LL work(int k, int a, int b) {

    int side =  << (k - );

    if (a > side || b < ) {

        return ;

    }

    if (a <=  && b >= side) {

        return three[k - ];

    }

    int aa = a - ( << (k - ));

    int bb = b - ( << (k - ));

    return  * work(k - , a, b) + work(k - , aa, bb);

}

int main() {

    int T, a, b, k;

    three[] = ;

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

        three[i] = three[i - ] * ;

    }

    scanf("%d", &T);

    for (int t = ; t <= T; t++) {

        scanf("%d%d%d", &k, &a, &b);

        printf("Case %d: %lld\n", t, work(k, a, b));

    }

    return ;

}