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

}

/*
ID: t.lam1
LANG: JAVA
TASK: codejam
*/
import java.io.*;
import java.util.*;
import java.text.*;
import static java.lang.System.*;
import static java.lang.Integer.*;
import static java.lang.Double.*;
import static java.lang.Character.*;
import static java.util.Collections.*;
import static java.lang.Math.*;
import static java.util.Arrays.*;


class codejam {

  	public static void main (String [] args) throws IOException{
		codejam a=new codejam();
		a.run();
	}
	public void run()throws IOException
	{
		recycle();
	}
	public void recycle()throws IOException{
		Scanner file = new Scanner(new File("codejam.in"));
    	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("codejam.out")));
    	int cases = file.nextInt();
    	file.nextLine();
    	for(int x =0; x<cases; x++){
    		out.print("Case #"+(x+1)+": ");
    		int a = file.nextInt(), b = file.nextInt(), c = 0;
    		for(int n = a; n<=b; n++){
    			for(int m = n+1; m<=b; m++){
    				if(n<10||m<10)continue;
    				else{
    					String nn = ""+n, mm=""+m, temp = mm;
    					mm = mm.substring(mm.length()-1)+mm.substring(0,mm.length()-1);
    					while(!mm.equals(temp)){
    						if(mm.equals(nn)){
    							c++;
    							break;
    						}
    						mm = mm.substring(mm.length()-1)+mm.substring(0,mm.length()-1);
    					}
    				}
    			}
    		}
    		out.println(c);
    	}

    	out.close();
	}
	public void dancing()throws IOException{
		Scanner file = new Scanner(new File("codejam.in"));
    	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("codejam.out")));
    	int cases = file.nextInt();
    	file.nextLine();
    	for(int x =0; x<cases; x++){
    		out.print("Case #"+(x+1)+": ");
    		Scanner chop = new Scanner(file.nextLine());
    		int N = chop.nextInt(), S = chop.nextInt(), P = chop.nextInt(), nums = 0;
    		ArrayList<Integer> googlers = new ArrayList<Integer>();
    		for(int y = 0; y<N; y++){
    			googlers.add(chop.nextInt());
    		}
    		System.out.print(N+" "+S+" "+P+" ");
    		for(Integer a: googlers){
    			System.out.print(a+" ");
    			int temp = a/3;
    			int temp2 = a;
    			if(S>0){
    				if(P-(temp2-P)/2==2){
    					S--;
    					nums++;
    				}
	    			if(temp2-2*temp>=P&&(temp2-2*temp)-temp<2)nums++;
	    			else{
	    				temp++;
	    				if(temp2-2*temp>=P&&(temp2-2*temp)-temp<2)nums++;
	    			}
    			}
    			else{
	    			if(temp2-2*temp>=P&&(temp2-2*temp)-temp<2)nums++;
	    			else{
	    				temp++;
	    				if(temp2-2*temp>=P&&(temp2-2*temp)-temp<2)nums++;
	    			}
	    			
    			}

    		}
    		System.out.println("nums: "+nums);
    		out.println(nums);
    	}
    	out.close();
	}
	public void googleRese()throws IOException{
		Scanner file = new Scanner(new File("codejam.in"));
    	PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("codejam.out")));
    	int x = file.nextInt(); file.nextLine();
    	//ArrayList<String> cases = new ArrayList<String>();
    	Map<Character,Character> remap = new TreeMap<Character,Character>();
    	remap.put('a','y');
		remap.put('b','h');
		remap.put('c','e');
		remap.put('d','s');
		remap.put('e', 'o');
		remap.put('f', 'c');
		remap.put('g', 'v');
		remap.put('h', 'x');
		remap.put('i', 'd');
		remap.put('j', 'u');
		remap.put('k', 'i');
		remap.put('l', 'g');
		remap.put('m', 'l');
		remap.put('n', 'b');
		remap.put('o', 'k');
		remap.put('p', 'r');
		remap.put('r', 't');
		remap.put('s', 'n');
		remap.put('t', 'w');
		remap.put('u', 'j');
		remap.put('v', 'p');
		remap.put('w', 'f');
		remap.put('x', 'm');
		remap.put('y','a');
		remap.put('z','q');
		remap.put('q','z');
		remap.put(' ',' ');
        for(int y = 1; y<=x; y++){
        	String temp = file.nextLine();
        	out.print("Case #"+y+": ");
        	for(Character a: temp.toCharArray()){
        		if(remap.get(a)==null)System.out.println(a);
        		out.print(remap.get(a));
        	}
        	out.println();
        }   	
		out.close();
	}

}
