import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.StringTokenizer;

public class MainC {
	
	private static boolean esValido(Integer n,Integer A,Integer B,boolean comp)
	{
		
		int i=0;
		boolean valido=false;
		if (!comp || (n>=A && n<B))
		{
			if (n>9)
			{
				while((i+1)<n.toString().length() && valido==false)
				{
					if (n.toString().charAt(i)!=n.toString().charAt(i+1))
					{
						valido=true;
					}
					i++;
				}
			}
		}
		return valido;
	}
	
	private static String rotar(String i)
	{
		return (i.charAt(i.length()-1)+i.substring(0, i.length()-1));
	}
	
	private static void combValidas(Integer i,Integer A,Integer B,HashSet<Par> conj)
	{
		String aux=rotar(i.toString());
		Integer num=Integer.parseInt(aux);
		if (esValido(num,A,B,true))
		{
			if (!i.equals(num))
			{
				conj.add(new Par(i,num));
			}
			//System.out.println("Se encuentra el par " + i + ", "+num + " ya que esValido "+num+" en el intervalo "+ A+ "-"+B);
		}
		for (int j=0;j<i.toString().length()-2;j++)
		{
			aux=rotar(aux);
			num=Integer.parseInt(aux);
			if (esValido(num,A,B,true))
			{
				//System.out.println("Se encuentra el par " + i + ", "+num + " ya que esValido "+num+" en el intervalo "+ A+ "-"+B);
				if (!i.equals(num))
				{
					conj.add(new Par(i,num));
				}
			}
		}
	}
	
	private static Integer calcularResultado(Integer A, Integer B)
	{
		//Para cada número hay tantas combinaciones como su longitud menos 1 (podemos rotarlo n-1 veces)
		HashSet<Par> conj=new HashSet<Par>();
		for (int i=A;i<B;i++)
		{
			if (esValido(i,A,B,false))
			{
				combValidas(i,A,B,conj);
			}
		}
		//Imprimimos resultados
		for (Par p:conj)
		{
			System.out.println(p + " en "+A+"-"+B);
		}
		
		return conj.size();
	}
	
	public static void main(String[] args) {
		File archivo = null;
		FileReader fr = null;
		FileWriter wr = null;
		PrintWriter pw = null;
		BufferedReader br = null;
		Integer A,B;
		Integer num = 0;
		String linea;
		String aux;
		StringTokenizer st;
		try {
			archivo = new File("C:/Users/Pc/Desktop/input.in");
			fr = new FileReader(archivo);
			br = new BufferedReader(fr);
			wr = new FileWriter("C:/Users/Pc/Desktop/output.out");
			pw = new PrintWriter(wr);
			// Lectura del fichero
			while ((linea = br.readLine()) != null) {
				if (num != 0) {
					aux = "Case #" + num.toString() + ": ";	//Inicialización del case #N: 
					st=new StringTokenizer(linea," ");
					A=Integer.parseInt(st.nextToken());
					B=Integer.parseInt(st.nextToken());
					aux+=calcularResultado(A,B).toString();
					pw.println(aux);
				}
				num++;
			}

		} catch (Exception e) {
			e.printStackTrace();
		} finally {
			try {
				if (null != fr) {
					fr.close();
					wr.close();
				}
			} catch (Exception e2) {
				e2.printStackTrace();
			}
		}

	}
	
}
