import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

import java.io.*;import java.util.*;
public class Solution3
{
	public static void main(String args[]) throws IOException
	{
		BufferedReader br=new BufferedReader(new FileReader("input.txt"));
	    PrintWriter pw=new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
	    int lines=Integer.parseInt(br.readLine());
	    for(int q=1;q<=lines;q++)
	    {
	    	StringTokenizer st=new StringTokenizer(br.readLine());
	    	int A=Integer.parseInt(st.nextToken());
		    int B=Integer.parseInt(st.nextToken());
		    int ctr=0;
		    for(int n=A;n<=B;n++)
		    {
		    	for(int m=n+1;m<=B;m++)
		    	{
		    			String s1=String.valueOf(n);
			    		String s2=String.valueOf(m);
			    		int x1,x2,i;
			    		for(i=0;i<s1.length();i++)
			    		{
			    			if(s1.charAt(0)==s2.charAt(i))
			    			{
			    			String chk1=s1.substring(0,s2.length()-i);
				    		String chk2=s1.substring(s2.length()-i);
				    		String chk3=s2.substring(0,i);
				    		String chk4=s2.substring(i);
				    		if(chk1.equals(chk4)&&chk2.equals(chk3))
				    		  { ctr++;}
			    			}
			    		}        
		        }    
		    }
		    pw.println("Case #"+q+": "+ctr);
	    }
	    pw.close();
	    
	    
    }
    
}