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

public class Mirror {
	public static void main(String[] args) throws IOException { 
		Scanner scan = new Scanner(new File("C-small-attempt0.in"));
		FileWriter fstream = new FileWriter("out.txt");
		BufferedWriter out = new BufferedWriter(fstream);
		int numCases = scan.nextInt();
		for (int z = 0; z < numCases; z++) {
			int low = scan.nextInt();
			int high = scan.nextInt();
			int count = 0;
			for (int i = low; i < high; i++) {
				String lows = "" + i;
				String[] arr = new String[lows.length() - 1];
				for (int k = 0; k < arr.length; k++) {
					lows = lows.charAt(lows.length()-1) + lows.substring(0, lows.length()-1);
					arr[k] = lows;
				}
				for ( int j = i + 1; j <= high; j++) {
					String highs = "" + j;
					for (int k = 0; k < arr.length; k++) {
						if (arr[k].equals(highs)) {
							count++;
							break;
						}
					}
				}
			}
			out.write("Case #" + (z+1) + ": " + count);
			if ( z != numCases - 1)
				out.newLine();
		}
		out.close();
	}
}