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;
	}

}

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashMap;
import java.util.Vector;


public class qual3 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			FileReader fr = new FileReader("C:\\Users\\zyra\\Desktop\\codejam\\qual3.txt");
			BufferedReader br = new BufferedReader(fr);
			String line;
			int A;
			int B;
			line = br.readLine();
			int count = Integer.parseInt(line);
			int[] output = new int[count];
			Vector<String> poss = new Vector<String>();
			Vector<String> posses = new Vector<String>();
			for(int hh=0; hh<count; hh++){
				posses.clear();
				line = br.readLine();
				
				String[] split =line.split(" ");
				A = Integer.parseInt(split[0]);
				B = Integer.parseInt(split[1]);
				
				//System.out.println(A+" "+B);
				
				int recycled = 0;
				
				for(int m=A; m<=B; m++){
					String mStr = String.valueOf(m);
					/*
					//no leading zeros
					if(m%10 == 0){
						continue;
					}*/
					//no mirror integers, n and m uniqueness
					
					Boolean valid = false;
					for(int p=0; p<mStr.length(); p++){
						if(mStr.charAt(p) != mStr.charAt((p+(mStr.length()-1))%mStr.length())){
							valid = true;
							break;
						}
					}
					if(valid == false)
						continue;
					
					
					for(int q=1; q<mStr.length(); q++){
						String rev = reverse(mStr, q);
						if(rev.charAt(0) == '0' || mStr.equals(rev)){
							continue;
						}
						int num = Integer.parseInt(rev);
						
						if(num <= B && num>=A && posses.contains(mStr+","+rev)!=true && 
								posses.contains(rev+","+mStr)!=true)
						{
							recycled++;
							posses.add(mStr+","+rev);
							posses.add(rev+","+mStr);
							//System.out.println(m+" "+num);
						}
					}
					
					
				}
				System.out.println("*************");
				poss.add(String.valueOf(recycled));
			}
			fr.close();
			br.close();
			
			
			FileWriter fw = new FileWriter("C:\\Users\\zyra\\Desktop\\codejam\\out1.txt");
			for(int i=0; i<count; i++){
				String out = "Case #"+(i+1)+": "+poss.elementAt(i);
				
				System.out.println(out);
				fw.write(out+"\r\n");
			}
			fw.flush();
			fw.close();
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}

	public static String reverse(String input, int number){
		String toRet = "";
		
		String sub = input.substring(number);
		String sub2 = input.substring(0, number);
		toRet = sub+sub2;
		
		return toRet;
	}
	
}