import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Scanner;
import java.util.TreeMap;

class Recycled {
    public static void main(String args[]) throws IOException{
        Scanner in = new Scanner(new File("recycle.txt"));
        PrintWriter fw = new PrintWriter(new FileWriter(new File("recycle.out")));
        TreeMap<Integer, ArrayList<Integer> > map = new TreeMap<Integer, ArrayList<Integer> >();
        for(int i = 1; i <= 2000000; i++){
            ArrayList<Integer> arr = new ArrayList<Integer>();
            String it = "" + i;
            for(int k = 0; k < it.length(); k++){
                int temp = Integer.parseInt(it.substring(k + 1, it.length()) + it.substring(0, k+1));
                if(temp > i){
                    boolean add = true;
                    for(int ad = 0; ad < arr.size(); ad++){
                        if(temp==arr.get(ad)) add = false;
                    }
                    if(add) arr.add(temp);
                }
            }
            Collections.sort(arr);
            map.put(i, arr);
        }
        int cases = in.nextInt();
        for(int c = 1; c <= cases; c++){
            int A = in.nextInt();
            int B = in.nextInt();
            int pass = 0;
            for(int a = A; a < B; a++){
                if(map.get(a)==null) continue;
                ArrayList<Integer> list = map.get(a);
                for(int l = 0; l < list.size(); l++){
                    if(list.get(l) <= B) pass++;
                    else break;
                }
            }
            String out = "Case #" + c + ": " + pass;
            fw.println(out);
        }
        fw.close();
    }
}
