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.ivantod.codejam2012;

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


public class Numbers {

	private void process() throws Exception {
		
		Scanner s=new Scanner(System.in);
		int numCases=s.nextInt();
		s.nextLine();

		for (int ca=1; ca<=numCases; ca++) {
			int A=s.nextInt();
			int B=s.nextInt();
			Set<String> pairs=new HashSet<String>();
			
			for (int i=A; i<=B; i++) {
				String num=Integer.toString(i);
				String flip=Integer.toString(i);
				for (int j=num.length(); j>1; j--) {
					flip=flip.charAt(flip.length()-1)+flip.substring(0,flip.length()-1);
					if (!flip.startsWith("0") && !num.equals(flip) &&
							!pairs.contains(num+"_"+flip) && !pairs.contains(flip+"_"+num) &&
							Integer.parseInt(flip) >= A && Integer.parseInt(flip) <= B) {
						pairs.add(num+"_"+flip);
					}
				}
				
			}
			
			System.out.println("Case #"+ca+": "+pairs.size());
		}
	}
	
	
	public static void main(String[] args) {
		Numbers b=new Numbers();
		try {
			b.process();

		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}