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.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class ProblemC {
	
	public static void main(String[] args){
		
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		try{
			
			String line = in.readLine();

			int numLines = Integer.parseInt(line);

			for(int i = 1; i <= numLines; i++){
				
				System.out.print("Case #" + i + ": ");
				
				line = in.readLine();
				
				String[] nums = line.split(" ");
				
				int A = Integer.parseInt(nums[0]);
				int B = Integer.parseInt(nums[1]);
				
				int size = nums[0].length();
				
				int count = 0;
				
				for(int n = A; n < B; n++){
					String nStr = String.valueOf(n);
					ArrayList<String> pairs = new ArrayList<String>();
					for(int k = 1; k < size; k++){
						String mStr = nStr.substring(k, size) + nStr.substring(0, k);
						int m = Integer.parseInt(mStr);
						if(m > n && m <= B){
							String nm = n + "," + m;
							if(!pairs.contains(nm)){
								pairs.add(nm);
								count++;
							}
						}
					}
				}
				
				System.out.println(count);
			}
		}catch(IOException e){
			
		}
	}
}