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

public class MainApp {

	public static void main(String[] args) {
		String input = "";

		try {
			FileInputStream fstream = new FileInputStream("C-small-attempt2.in");

			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;

			while ((strLine = br.readLine()) != null) {
				input += strLine + "\n";
			}
			in.close();
		} catch (Exception e) {
		}

		String[] inputs = input.split("\n");
		
		int len = inputs.length;
	
		for (int p = 1; p < len; ++p) {
			int count = 0;
			
			String[] split = inputs[p].split(" ");
			
			int A = Integer.parseInt(split[0]);
			int B = Integer.parseInt(split[1]);

			int n = A;
			
			while (n < B - 1) {
				for (int m = (n + 1); m <= B; ++m) {
					String strN = String.valueOf(n);
					
					for (int k = strN.length(); k > 1; --k) {
						String str = strN.substring(k - 1, strN.length()) + strN.substring(0, k - 1);

						int a = Integer.parseInt(str);
						
						if (a == m) {
							count++;
							break;
						}
					}
				}
				
				n++;
			}

			System.out.println("Case #" + p + ": " + count);
		}
	}
}
