import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;

public class Recycled {

	public static void main(String[] args) throws Exception {
		
//		if(true){
//			System.out.println(recycle("12345", 4));
//			return;
//		}

		BufferedReader in = new BufferedReader(new FileReader("recycled.in"));
		PrintWriter out = new PrintWriter(new FileWriter("recycled.out"));

		String lineStr;
		int T;
		long A, B, result, n, m;

		T = Integer.parseInt(in.readLine());

		for (int line = 1; line <= T; line++) {
			// get input
			lineStr = in.readLine();
			String[] fields = lineStr.split(" ");
			A = Long.parseLong(fields[0]);
			B = Long.parseLong(fields[1]);

			// compute result
			result = 0;
			for (n = A; n < B; n++) {
				for (m = A + 1; m <= B; m++) {
					if (isRecyled(n, m)) {
						result++;
					}
				}
			}

			// edit result
			out.println("Case #" + line + ": " + result);
			System.out.println(lineStr + " : " + result);
		}

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

	private static boolean isRecyled(long n, long m) {
		// condition n<m
		if (m <= n) {
			return false;
		}
		String strN = String.valueOf(n);
		String strM = String.valueOf(m);
		// condition more than one digit
		if (strN.length() == 1 || strM.length() == 1) {
			return false;
		}
		int digitCount = strN.length();
		for (int i = 1; i < digitCount; i++) {
			String recycledN = recycle(strN, i);
			if (recycledN.equals(strM)) {
				return true;
			}
		}
		return false;
	}

	/**
	 * Move i digits from back of X to the front
	 * 
	 * @param X
	 * @param i
	 * @return
	 */
	private static String recycle(String X, int i) {
		int len = X.length();
		String head = X.substring(0, len - i);
		String tail = X.substring(len - i, len);
		//System.out.println(X+" = "+head+" + "+tail + " len="+len);
		return tail.concat(head);
	}
}
