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;
	}
}

package com.codejam.twelve;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.HashSet;

public class ProbC {
	public static void main(String[] args) throws IOException {
		FileReader fr = new FileReader(
				"D:\\Dev\\Workspaces\\Android\\codejam\\io\\qualification\\C-small-attempt0.in");
		FileWriter fw = new FileWriter(
				"D:\\Dev\\Workspaces\\Android\\codejam\\io\\qualification\\C-small-attempt0.out");
		BufferedReader br = new BufferedReader(fr);
		BufferedWriter bw = new BufferedWriter(fw);

		int t = Integer.parseInt(br.readLine());

		for (int l = 1; l <= t; l++) {
			String s = br.readLine();
			bw.append("Case #" + l + ": ");

			String ss[] = s.split(" ");

			int A = Integer.parseInt(ss[0]);
			int B = Integer.parseInt(ss[1]);

			int ans = 0;
			HashSet<String> hs = new HashSet<String>();

			for (int i = A; i < B; i++) {
				String n = "" + i;
				int len = n.length();
				for (int j = 0; j < len - 1; j++) {
					n = n.charAt(n.length() - 1)
							+ n.substring(0, n.length() - 1);
					int nn = Integer.parseInt(n);
					if (nn > i && nn <= B) {
						/*System.out.println(i + "," + nn);
						if (hs.contains(i + "," + nn)) {
							System.out.println("**********");
						} else*/
						if (!hs.contains(i + "," + nn)){
							hs.add(i + "," + nn);
							ans++;
						}
					}
				}

			}

			bw.append("" + ans);

			bw.newLine();
		}

		bw.flush();
		bw.close();
		br.close();
	}
}
