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.google.code;

import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.TreeMap;

public class C extends GCJ {

	public C() throws IOException {
		super();
	}

	@Override
	protected void code(int count) throws IOException {
		readLine();
		int n = getIntInput(0);
		int m = getIntInput(1);
		int counter =0;
		if (m<10) {
			writeln(0);
			return;
		}
		n = Math.max(n, 10);
		
		
		for (int i=n;i<m+1;i++) {			
			String string = String.valueOf(i);
			HashMap<String, Object> done = new HashMap<String, Object>();
			for (int j=1;j<string.length();j++) {
				int spinned = Integer.parseInt(string.substring(j)+string.substring(0, j)); 
				if (spinned>i && spinned <=m) {
					if (done.containsKey(String.valueOf(spinned)))
						continue;
					done.put(String.valueOf(spinned), null);
					counter++;
				}				
			}			
		}
		writeln(counter);
	}

	/**
	 * @param args
	 * @throws IOException 
	 * @throws NumberFormatException 
	 */
	public static void main(String[] args) throws NumberFormatException, IOException {
		new C().run();

	}

}
