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.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.*;

public class Main
{
    public static void main(String[] args)
            throws Exception
    {
        BufferedReader in = new BufferedReader(new FileReader(args[0]));
        FileWriter out = new FileWriter(args[1]);
        int T = Integer.parseInt(in.readLine());

        for (int t = 1; t <= T; t++)
        {
            String data[] = in.readLine().split("\\ ");
            int A = Integer.parseInt(data[0]);
            int B = Integer.parseInt(data[1]);

            Set<Integer> checked = new LinkedHashSet<Integer>();

            int recycledPairNumber = 0;

            for (int i = A; i <= B; i++)
            {
                if (checked.contains(i))
                    continue;

                String s = Integer.toString(i);
                String ss = s + s;

                Set<Integer> recycled = new LinkedHashSet<Integer>();
                recycled.add(i);
                for (int j = 0; j < s.length(); j++)
                {
                    int candidate = Integer.parseInt(ss.substring(j, j + s.length()));
                    if (candidate >= A && candidate <= B)
                        recycled.add(candidate);
                }

                if (recycled.size() == 1)
                    continue;

                checked.addAll(recycled);

                recycledPairNumber += (recycled.size() * (recycled.size() - 1)) / 2;
            }

            out.write("Case #" + t + ": " + recycledPairNumber + "\n");
        }

        in.close();
        out.close();
    }
}
