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 mgg.problems;

import java.util.ArrayList;
import java.util.List;

import mgg.utils.FileUtil;
import mgg.utils.Pair;
import mgg.utils.StringUtils;

/**
 * @author manolo
 * @date 14/04/12
 */
public class ProblemC {

	public final static String EXAMPLE_IN = "C-example.in";
	public final static String EXAMPLE_OUT = "C-example.out";

	public final static String C_SMALL_IN = "C-small-attempt0.in";
	public final static String C_SMALL_OUT = "C-small-attempt0.out";

	public final static String C_LARGE_IN= "C-large-practice.in";
	public final static String C_LARGE_OUT = "C-large-practice.out";

	public final static String delim = " ";

	public static String solve(FileUtil util) {

		String line = util.getLine();
		List<Integer> listOfArgs = StringUtils.stringWithIntegersToList(line, delim);

		final int A = listOfArgs.get(0);
		System.out.println("\tA = " + A);

		final int B = listOfArgs.get(1);
		System.out.println("\tB = " + B);

		//ArrayList<Pair> solution = new ArrayList<Pair>();
		int found = 0;
		for(int i = A; i < B ; i++){
			for(int j = A + 1; j <= B ; j++){
				if(i<j){
					if(recicled(i, j)){
						found++;//solution.add(new Pair(i, j));
					}
				}
			}
		}

		//System.out.println("Solution: " + solution);
		System.out.println("Found: " + found);

		return "" + found;
	}

	private static boolean recicled(int n, int m) {

		int numCiphers = numCiphers(n);

		//System.out.println("n: " + n + "(" + numCiphers + ")");

		for(int i = 0; i < numCiphers; i++){
			int aux_n = moveCiphersToFront(n, i, numCiphers);
			//System.out.println("aux_n: " + aux_n);
			
			if(aux_n == m){
				return true;
			}
		}

		return false;
	}

	private static int numCiphers(int n) {
		int result = 0;
		while(n > 0){
			n = n / 10;
			result++;
		}
		return result;
	}

	private static int moveCiphersToFront(int number, int howManyCiphers, int numCiphers) {
		String num = "" + number;

		String newNumber = num.substring(numCiphers-howManyCiphers, numCiphers) +
		num.substring(0, numCiphers-howManyCiphers);

		//System.out.println("new number: " + newNumber);

		return Integer.parseInt(newNumber);
	}

}
