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


public class RecycledNum {

	/**
	 * @param args
	 */
	
	static int abc[]=new int[1000];
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		int t=0,n = 0,len=0,k=0,l=0;
		int count[]=new int[100];
		int num1[]=new int[100];
		int num2[]=new int[100];
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		try {
			n=Integer.parseInt(br.readLine());
		} catch (NumberFormatException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		} catch (IOException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
		
		while(t<n)
		{
			try {
				String s=br.readLine();
				int ind=0;
				String s1="";
				String s2="";
				ind=s.indexOf(' ');
				for(int i=0;i<ind;i++)
				{
					s1+=s.charAt(i);					
				}
				for(int i=ind+1;i<s.length();i++)
				{
					s2+=s.charAt(i);					
				}
				num1[t]=Integer.parseInt(s1);
				num2[t]=Integer.parseInt(s2);
				/*System.out.println(num1[t]);
				System.out.println(num2[t]);*/
				/*num1[t]=Integer.parseInt(br.readLine());
				num2[t]=Integer.parseInt(br.readLine());*/
			} catch (NumberFormatException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			} catch (IOException e) {
				// TODO Auto-generated catch block
				e.printStackTrace();
			}
			t++;
		}
		
	
		
		t=0;
		while(t<n)
		{
			count[t]=0;
			len=0;
			
		int n1=num1[t];
		int n2=num2[t];
		/*System.out.println("n1:"+n1);
		System.out.println("n2:"+n2);*/
		for(int i=0;n1!=0;i++)
		{
			n1=n1/10;
			len++;
					
		}
		n1=num1[t];
		//System.out.println(len);

		/*System.out.println("n1:"+n1);
		System.out.println("n2:"+n2);*/
		for(int i=n1;i<=n2;i++)
		{
			k=i;
			l=0;
			for(int j=0;j<len-1;j++)
			{
				l=k;
				//System.out.println("l="+l);
				k=l%10;
				l=l/10;
				k*=Math.pow(10,len-1);
				k+=l;
		
				//System.out.println("k="+k);
				
				
				if(k>i && k<=n2)
				{
					count[t]++;
					//System.out.println(count[t]);
							
				}
				
			}
		}
	
		t++;
		/*System.out.println("n1:"+n1);
		System.out.println("n2:"+n2);*/
		}
		//System.out.println("t="+t);
		for(int i=0;i<n;i++)
		{
		System.out.println("Case #"+(i+1)+": "+count[i]);
		}
		
	}

}
