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.util.LinkedList;
import java.util.StringTokenizer;

public class RecycledNumbers {
//	private static String INPUT_FILE = "input.txt";
	private static String INPUT_FILE = "C-small-attempt0.in";
	
	
	private static final String DELIM = " ";
	
	public void solve() {
		try {
			BufferedReader in = new BufferedReader(new FileReader(INPUT_FILE));
			
			int T = Integer.valueOf(in.readLine());
			
			String line;
			for(int i = 0; i < T; i++) {
				line = in.readLine();
				
				StringTokenizer st = new StringTokenizer(line, DELIM);
				
				int A = Integer.valueOf(st.nextToken());
				int B = Integer.valueOf(st.nextToken());
				
				process(i + 1, A, B);
			}
		}
		catch(Exception e) {}
	}
	
	protected void process(int idx, int A, int B) {
		int cnt = 0;
		
		String digit;
		int len;
		StringBuffer sb;
		String r;
		int d;
		LinkedList<String> list = new LinkedList<String>();
		String pair;
		
		for(int i = A; i <= B; i++) {
			digit = Integer.toString(i);
			len = digit.length();
			
			if(len > 1 && !digit.endsWith("0")) {
				for(int j = 1; j <= len - 1; j++) {
					sb = new StringBuffer();
					sb.append(digit.substring(len - j, len));
					sb.append(digit.substring(0, len - j));
					
					r = sb.toString();
					
					if(r.charAt(0) != '0' && !r.equals(digit)) {
						d = Integer.valueOf(r);
						
						if(d >= A && d <= B) {
							if(i < d)
								pair = i + "|" + d;
							else
								pair = d + "|" + i;
							
							if(!list.contains(pair)) {
								list.add(pair);
								cnt++;
							}
						}
					}
				}
			}
		}
		
		System.out.println("Case #" + idx + ": " + cnt);
	}
	
	public static void main(String[] args) {
		RecycledNumbers r = new RecycledNumbers();
		r.solve();
	}

}
