import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;


public class RecycledNumbers {
	
	public static int len(int A){
		int k = 1 ;
		int r = 0;
		while( k < A){
			k = k * 10;
			r = r + 1;
		}
		return r;
	}
	public static int count(int A , int B){
		int r = 0;
		for(int i = A ; i < B ; i ++){
			int mul = 1 ;
			int len = 0;
			while(mul <= i){
				mul = mul * 10;
				len = len + 1;
			}
			
			int[] prev = new int[len - 1];
			int it = 10;
			for(int j = 0 ; j < len - 1 ; j ++){
				int right = i % it;
				int left = i / it;
				mul = mul / 10;
				int result = right * mul + left;
				it = it * 10;
				
				boolean duplicate = false;
				for(int k = 0 ; k < j ; k ++){
					if(result == prev[k]){
						duplicate = true;
						break;
					}
				}
				if(result > i && result >= A && result <= B && !duplicate){
				//	System.out.println(result + "\t" + i);
					r ++;
					prev[j] = result;
				}
			}
		}
		return r;
	}
	
	public static void main(String args[]) throws IOException{
		//System.out.println(count(1 , 2000000));
		BufferedReader reader = new BufferedReader(new FileReader(new File("C-large.in")));
		BufferedWriter writer = new BufferedWriter(new FileWriter(new File("output.txt")));
		String line = reader.readLine();
		int T = Integer.parseInt(line);
		for(int i = 0 ; i < T ; i ++){
			line = reader.readLine();
			String tokens[] = line.split("\\s+");
			int N = Integer.parseInt(tokens[0]);
			int S = Integer.parseInt(tokens[1]);
			int count = count(N , S);
			writer.write("Case #" + (i + 1) + ": " + count + "\r\n");
		}
		reader.close();
		writer.close();
	}

}
