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

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package gcj_c;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.StringTokenizer;
import java.util.logging.Level;
import java.util.logging.Logger;

/**
 *
 * @author kay
 */
public class Arrange {

    private int first;
    private int last;
    private BufferedReader reader;
    private StringTokenizer token;

    public void do_processing(String filename) {
        String current_line;
        int no_of_cases;
        try {
            reader = new BufferedReader(new FileReader(filename));
            FileWriter fstream = new FileWriter("G:/out.txt");
            BufferedWriter out = new BufferedWriter(fstream);
            no_of_cases = Integer.parseInt(reader.readLine());

            for (int i = 1; i <= no_of_cases; i++) {
                current_line = reader.readLine();
                out.write("Case #" + i + ": ");
                out.write(String.valueOf(do_arrange(current_line)));
                //out.write(String.valueOf(3));
                //System.out.println("outputttttttttttttttt " + do_arrange(current_line));
                out.newLine();
                //Close the output stream
            }
            out.close();
            reader.close();
        } catch (Exception ex) {
            Logger.getLogger(Arrange.class.getName()).log(Level.SEVERE, null, ex);
        }
    }

    public int do_arrange(String line) {
        int output = 0, temp,temp2, tens = 1, no_of_digits = 0, new_num = 0, mod = 1, add_tens = 1;
        token = new StringTokenizer(line);
        first = Integer.parseInt(token.nextToken());
        last = Integer.parseInt(token.nextToken());
        System.out.println(first + "" +last);
        temp = first;
        while (temp > 0) {
            temp /= 10;
            no_of_digits++;
        }
        
        if (no_of_digits == 1) {
            output = 0;
        } else {
           
            for (int i = first; i <= last; i++){
                temp = i;
                tens = 1;
                add_tens = 1;
                
                for (int j = 1; j < no_of_digits; j++){
                    add_tens = 1;
                    temp = i;
                    temp2 = i;
                    temp2 /= (tens * 10);
                    temp %= (tens * 10);
                    //System.out.println(temp);
                    for (int k=1; k<=(no_of_digits - j); k++){
                        add_tens *= 10;
                    }
                    //System.out.println("add tens" + add_tens);
                    tens *=10;
                    
                    new_num = (temp * add_tens) + temp2;
                    //System.out.println("newwwwwwwww " + new_num);
                    
                    //System.out.println("iiiiiiii "+ i);
                    if((new_num >= first) && (new_num > i) && (new_num <= last)){
                     //System.out.println("adddedd outtput");
                     output++;
                     
                 }
                }
                
                 
                
            }
        }
        System.out.println("output   " + output);
        return output;
    }
}
