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.FileReader;
import java.io.FileWriter;




public class recyclednumbers {

	public static void main(String [] args) throws Exception
	{
		BufferedReader reader = new BufferedReader (new FileReader("C:\\inputFile.txt"));
		
		int number_of_TestCases = (int) Integer.parseInt(reader.readLine());
		
		long testcases[] [] = new long [number_of_TestCases] [2];
		
		for(int i=0;i<number_of_TestCases; i++)
		{
			String testcase = reader.readLine();
			
			testcase = testcase.trim();
			
			String [] inputs = testcase.split(" ");
			
			testcases[i][0] = Long.parseLong(inputs[0]);
			testcases[i][1] = Long.parseLong(inputs[1]);
			
			long result = findDistinctPairs ( testcases [i][0], testcases[i][1]);
			writeResult(i+1, result);
		}	
	
		
	}
	
	private static long findDistinctPairs(long a, long b) 
	{
		long totalpairs_count = 0;
		
		while(a<=b)
		{
			long pairs_count = findPair(a,b);						
			a++;
			totalpairs_count += pairs_count;
		}
		return totalpairs_count;
	}
	
	private static void writeResult(int testcase, long result) throws Exception
	{
		FileWriter fout = new FileWriter("C:\\recycleout.txt", true);
		String output= "Case #"+testcase+": "+result+System.getProperty("line.separator");
		fout.write(output);
		fout.close();
	}
	
	private static long findPair(long a,long upperLimit)
	{
		long pairs_count =0;
		String a_str = Long.toString(a);
		String b = rotate(a_str);
		

		while(!b.equals(a_str))
		{
			long b_val = Long.parseLong(b);
			if(b_val<=upperLimit && b_val>a ) // also check for leading zero
			{
				pairs_count++;
			
			}
			b = rotate(b);
		}
		return pairs_count;
	}
	
	private static String rotate(String a)
	{
		String num = a;
		char[] digits= num.toCharArray();
		
		String newNum = ""+digits[digits.length-1];
		
		for(int i=0;i<digits.length-1;i++)
			newNum = newNum+digits[i];
		
		return newNum;
	}
}
