import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.ArrayList;

public class C {

	public static long convert(String input) {
		long output = 0;
		String[] pairs = input.split(" ");
		String first = pairs[0];
		String second = pairs[1];
		if (first.length() != 1) {
			long firstInt = Long.parseLong(first);
			long secondInt = Long.parseLong(second);
			for (long k = firstInt; k < secondInt; k++) {
				String firstNum = k + "";
				if (!same(firstNum)) {
					int len = firstNum.length();
					for (int i = 0; i < len - 1; i++) {
						char lastChar = firstNum.charAt(len - 1);
						String newFirstNum = lastChar
								+ firstNum.substring(0, len - 1);
//						 System.out.println(firstNum + "---" +
//								 newFirstNum);
//						list2.add(newFirstNum);
						long secondNum = Long.parseLong(newFirstNum);
						if ((secondNum + "").length() == firstNum.length()) {
							if (secondNum <= secondInt && secondNum > k
									) {
								output++;
//								 System.out.println(k + "---" +
//										 secondNum);
							}
						}
						firstNum = newFirstNum;
					}
				}
			}
		}

		return output;
	}


	private static boolean same(String s) {
		for (int i = 0; i < s.length() - 1; i++) {
			if (s.charAt(i) != s.charAt(i + 1))
				return false;
		}
		return true;
	}

	public static void main(String[] args) {
		String inputFile = "C-large.in";
		String outPutFile = "C-large.out";
		try {
			FileInputStream fstream = new FileInputStream(inputFile);
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			FileWriter fstream2 = new FileWriter(outPutFile);
			BufferedWriter out = new BufferedWriter(fstream2);
			String strLine;
			strLine = br.readLine();
			int casesNum = Integer.parseInt(strLine);
			for (int i = 0; i < casesNum; i++) {
				strLine = br.readLine();
				String parse = "Case #" + (i + 1) + ": " + convert(strLine);
				System.out.println(parse);
				if (i < casesNum - 1)
					parse += "\n";
				out.write(parse);
			}
			in.close();
			out.close();
		} catch (Exception e) {
			System.err.println("Error: " + e.getMessage());
		}

	}

}
