import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

package package03;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.Iterator;
import java.util.List;
import java.util.Scanner;
import java.util.Set;

public class RecycledNumbers {
	
	private static void checkInputFile(String filePath) throws IOException{
		BufferedReader br=new BufferedReader(new FileReader(new File(filePath)));
		PrintWriter output=new PrintWriter(filePath.concat(".out"));
		
		String str=new String();
		int row=0;
		
		while((str=br.readLine())!=null){
			if(row!=0){
				int as=checkOneline(str);
				output.println("Case #"+row+": "+as);
			}
			row=row+1;
		}
		output.close();
		br.close();
	}
	
	private static int checkOneline(String str) {
		int as=0;
		int minNumb=0;
		int maxNumb=0;
		
		//å°ä¸è¡æ°å­çå­ç¬¦ä¸²è½¬ä¸ºæ´åList;
		List<Integer> iLst=getIntLstFromString(str);
		
		minNumb=iLst.get(0);
		maxNumb=iLst.get(1)+1;
		
		for(int a=minNumb;a<maxNumb+1;a++){
			String tst=String.valueOf(a);
			Set<Integer> is=new HashSet<Integer>();
			for(int i=1;i<tst.length();i++){
				String str1=tst.substring(0, i);
				String str2=tst.substring(i);
				int a1=Integer.valueOf(str2.concat(str1));
				is.add(a1);
			}
			for(Iterator<Integer> it=is.iterator();it.hasNext();){
				int a1=it.next();
				if(a1>a && a1<maxNumb){
					as=as+1;
				}
			}
		}
		
		return as;
	}

	private static List<Integer> getIntLstFromString(String str){
		//å°ä¸è¡æ°å­çå­ç¬¦ä¸²è½¬ä¸ºæ´åList;
			List<Integer> iLst=new ArrayList<Integer>();
			int j=0;
			for(int i=0;i<str.length();i++){
				if(str.substring(i, i+1).equals(" ")){
					iLst.add(Integer.valueOf(str.substring(j, i)));
					j=i+1;
				}
			}
			iLst.add(Integer.valueOf(str.substring(j, str.length())));
			return iLst;
	}
	public static void main(String args[]) throws IOException{
		Scanner scanner=new Scanner(System.in);
		String inputFilePath=scanner.nextLine();
		checkInputFile(inputFilePath);
	}
}
