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

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

import java.io.*;
public class C 
{
	public static void main(String[] argv) throws IOException
	{		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int num = Integer.parseInt(br.readLine());
		for(int i=0 ; i<num ; i++)
		{
			String str = br.readLine();
			String[] arr = str.split(" ");
			int A = Integer.parseInt(arr[0]);
			int B = Integer.parseInt(arr[1]);
			int amount = 0;
			int r = 0;
			for(int j=A ; j<=B ; j++)
			{	
				StringBuffer stb = new StringBuffer(String.valueOf(j));
				
				for(int k=0 ; k<stb.length() ; k++)//total assume
				{	
					stb.append(stb.substring(0,1));
					stb.delete(0,1);
					
					int now = Integer.parseInt(stb.toString());
					if(now<=B && now>=j+1 && (j+1<=B))
					{
						amount++;						
					}					
				}
			}			
			
			System.out.println("Case #" + (i+1) + ": " + amount);			
		}
	}
	
}
