import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

package google.codejam;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.Scanner;

public class Stark_C {

	/**
	 * @param args
	 */
	public static int getDig(int t1){
		if(t1==0) return 0;
		else if(t1<10) return 1; 
		else if(t1<100) return 2;
		else if(t1<1000) return 3;
		else if(t1<10000) return 4;
		else if(t1<100000) return 5;
		else if(t1<1000000) return 6;
		else return 7;
	}
	
	public static int times(int t){
		
		if(t==0)return 1;
		else	if(t==1)	return 10;
		else	if(t==2) return 100;
		else	if(t==3) return 1000;		
		else	if(t==4) return 10000;
		else	if(t==5) return 100000;		
		else	if(t==6) return 1000000;	
		else	if(t==7) return 10000000;
		else return 100000000;
	
	}
	
	public static void main(String[] args) throws Exception {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(new FileReader("C_small.in"));
		PrintWriter pw = new PrintWriter(new FileWriter("C_small.out"));
		
		int total = sc.nextInt();
		
		
		
		for(int i=0; i<total; i++){
			
			pw.print("Case #" + (i + 1) + ": ");
			
			int t1 = sc.nextInt();
			int t2 = sc.nextInt();
			
			//pw.print(t1+"  "+t2+ "  ");
			
			int n=t1;
			int m=t2;
			int ans=0;
			
			while(n<t2){
				
				int te=10;
				while(m!=n){
					int divi = n/te;
					int rem = n%te;
					m = rem*times(getDig(divi))+divi;
					
					//pw.print("n= "+n+",m = "+m+";;;");					
					if(m>t1 && m>n && m<=t2) ans++;
					//pw.print("  ans-->"+ans+"  ");
					te = te*10;
					
				}
				
				
				n++;
			}
			
			
			
			
			pw.println(ans);
			
			
			
		}
		pw.flush();
		pw.close();
		sc.close();
	}
	
	

}
