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 com.qualification;

import java.io.*;
import java.util.ArrayList;
import java.util.List;

public class Two {
    public static void main(String[] args) throws FileNotFoundException, IOException {
        FileReader fr = new FileReader("/Users/minerva/Desktop/input.txt");
        FileWriter fw = new FileWriter("/Users/minerva/Desktop/output.txt");
        
        BufferedReader br = new BufferedReader(fr);
        PrintWriter pr = new PrintWriter(fw);
        
        int numInputs = Integer.valueOf(br.readLine());
        
        for(int i=0;i<numInputs;i++) {
            String str = br.readLine();
            String values[] = str.split(" ");
            int num1 = Integer.parseInt(values[0]);
            int num2 = Integer.parseInt(values[1]);
            
            pr.println("Case #" + (i + 1) + ": " + Shifter.count(num1, num2));
        }
        pr.flush();
    }
}

class Shifter {
    private long input;
    private List<Long> rmap = new ArrayList<Long>();
    
    public Shifter(long input) {
        this.input = input;
    }
    
    private List<Long> generate() {
        int length = new Long(input).toString().length();
        long pow10 = (long)Math.pow(10,length);
        
        for (int pow = 10;;pow *= 10) {
            long n1 = input / pow;
            long n2 = input % pow;
            
            if (n1 == 0) break;
            
            long n3 = n2 * pow10 / pow + n1;
            //System.out.print(n1 + "," + n2 + " (" + input + "," + n3 + ")");
            
            if (n3 > input) {
                //System.out.println("*");
                int n3len = new Long(n3).toString().length();
                if (n3len == length && !rmap.contains(n3)) rmap.add(n3);
            } else {
                //System.out.println();
            }
        }
        
        return rmap;
    }
    
    public static long count(long num1, long num2) {
        long count = 0;
        
        for (long i = num1; i <= num2; i++) {
            List<Long> results = new Shifter(i).generate();
            for(Long item:results) {
                if (item <= num2) {
                    count++;
                    //System.out.println("(" + i + "," + item + ")");
                }
            }
        }
        
        return count;
    }
}

/* in    op     
 * 1234  2341
 */
