import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t=sc.nextInt();
		int casos=1, a, b, n, m, cont;
		while(t!=0){
			a=sc.nextInt();
			b=sc.nextInt();
			if(a>b){
				int aux=a;
				a=b;
				b=aux;
			}
			System.out.printf("Case #%d: ",casos++);
			if(a==b){
				System.out.printf("%d\n",0);
			}else{
				cont=0;
				for(n=a;n<b;n++){					
					for(m=n+1;m<=b;m++){					
						if(isRecycled(n,m)) cont++;
					}
				}
				System.out.printf("%d\n",cont);
			}
			t--;
		}		
	}
	public static boolean isRecycled(int n1, int n2){
		String s1, s2, aux;
		s1 =  String.valueOf( n1 );
		s2 =  String.valueOf( n2 );		
		boolean r = false;		
		for(int i=0;i<s1.length();i++){
			aux="";
			aux=s1.substring(i,s1.length())+s1.substring(0,i);
//			System.out.println(aux);
			if(aux.equals(s2)){
				r=true;
				break;
			}
		}		
		return r;
	}
}

import java.io.*;
import java.util.*;

public class ProbC
{
	public static void main(String[] args) throws FileNotFoundException, IOException
	{
		BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
		int times = Integer.parseInt(br.readLine());
		BufferedWriter wr = new BufferedWriter(new FileWriter("C-small-attempt0soln.in"));
		for (int i = 0; i < times; i++)
		{
			String sentence = br.readLine();
			String[] nums = sentence.split(" ");
			int a = Integer.parseInt(nums[0]);
			int b = Integer.parseInt(nums[1]);
			int recycledPairs = 0;
			ArrayList<Integer> firstIncluded = new ArrayList<Integer>();
			ArrayList<Integer> secondIncluded = new ArrayList<Integer>();

			for (int currNum = a; currNum <= b; currNum++)
			{
				if (!firstIncluded.contains(currNum))
				{
					boolean currNumAdded = false;
					String currNumString = currNum + "";

					int digits = currNumString.length();
					for (int x = 0; x < digits; x++)
					{
						currNumString = currNumString.substring(currNumString.length() - 1) + currNumString.substring(0, currNumString.length() - 1);

						int currNumCheck = Integer.parseInt(currNumString);
						if (currNumCheck >= a && currNumCheck <= b && !(firstIncluded.contains(currNum) && secondIncluded.get(firstIncluded.indexOf(currNum)).equals(currNumCheck)) && !(secondIncluded.contains(currNumCheck) && firstIncluded.get(secondIncluded.indexOf(currNumCheck)).equals(currNum)) && currNumCheck != currNum)
						{
							secondIncluded.add(currNumCheck);
							recycledPairs++;
							//if (!currNumAdded)
							//{
								firstIncluded.add(currNum);
							//	currNumAdded = true;
						//	}
						//	System.out.println("(" + currNum + ", " + currNumString + ")");
						}
						/*else
						{
							if (currNumCheck >= a && currNumCheck <= b && currNumCheck != currNum) //&& !numsAlreadyIncluded.contains(currNumCheck) && currNumCheck != currNum)
								System.out.println("(" + currNum + ", " + currNumCheck + ")");
						}*/
					}
				}
			}
			recycledPairs /= 2;
			wr.write("Case #" + (i+1) + ": " + recycledPairs);
			wr.newLine();
		}
		wr.close();
	}
}