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

package codejam;
import java.io.*;
import java.util.*;

public class RecycledNumbers {

	public static void RecycledNumbersProcess() throws Exception
	{
	
		int t_cases= getT();
		for(int i = 1; i<=t_cases;i++)
		{
				String line = getG();
				long A, B;
				String[] charNUMBERS = line.split(" ");
						
				A = Long.parseLong(charNUMBERS[0]);
				B = Long.parseLong(charNUMBERS[1]);
	
				//Check no of digits
				int NoOfDigits = charNUMBERS[0].length();
				
				HashSet hsUnique = new HashSet();
				hsUnique.clear();
				
				long OutputCount;
				OutputCount = 0;
				
				for(long j=A; j<=B; j++)
				{
				
					long tempA = j;
							
					for(int k = 0; k<NoOfDigits-1; k++)
					{
						long Rem = tempA%10;
						long newA = tempA/10;
						newA = newA + Rem*new Double(Math.pow(10,NoOfDigits-1)).longValue();

						tempA = newA;
						
						//Check for satisfying condition
						if(newA > j && newA >= A && newA <= B)
						{
							OutputCount++;
							
							String jStr = String.valueOf(j);
							String newAStr = String.valueOf(newA);
							
							String pair = jStr + newAStr;

							hsUnique.add(pair);
						}
					}//for loop k
				}//for loop j
			
		
				//System.out.print("Case #" + i + ": " + hsUnique.size()+"\n");
				out.write("Case #" + i + ": " + hsUnique.size()+"\n");
				
				hsUnique = null;

		}
		
	}
	
	public static BufferedReader stdin = new BufferedReader(new InputStreamReader(System.in));
	public static File input;
	public static FileReader inputreader;
	public static BufferedReader in;
	public static File output;
	public static FileWriter outputwriter;
	public static BufferedWriter out;
	public static StringTokenizer st;
	
	public static void main(String[] args) throws Exception {
		
		input = new File("smallinputRN.in.txt");
		inputreader = new FileReader(input);
		in = new BufferedReader(inputreader);
		output = new File("smalloutputRN.out.txt");
		outputwriter = new FileWriter(output);
		out = new BufferedWriter(outputwriter);
		RecycledNumbersProcess();
		close();
	}
	
	
	public static void close() throws IOException {
		if(in!=null)in.close();
		if(inputreader!=null)inputreader.close();
		if(out!=null)out.flush();
		if(out!=null)out.close();
		if(outputwriter!=null)outputwriter.close();
	}
	
	// ************************** INPUT READING *****************
	static String LINE() throws IOException { return in.readLine();}
	static int getT() throws IOException {return Integer.parseInt(LINE());}
	static String getG() throws IOException {return LINE();}
	
}


