package Main;

import com.sun.deploy.util.ArrayUtil;
import org.apache.commons.lang3.ArrayUtils;

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;

/**
 * Created with IntelliJ IDEA.
 * User: arran
 * Date: 14/04/12
 * Time: 3:12 PM
 * To change this template use File | Settings | File Templates.
 */
public class Round {
    public StringBuilder parse(BufferedReader in) throws IOException {
        StringBuilder out = new StringBuilder();
        String lineCount = in.readLine();

        for (int i = 1; i <= Integer.parseInt(lineCount); i++)
        {
            out.append("Case #"+i+": ");
            System.err.println("Case #"+i+": ");
            String line = in.readLine();
            String[] splits = line.split(" ");
            int p1 = Integer.valueOf(splits[0]);
            int p2 = Integer.valueOf(splits[1]);
            int r = pairRecyclable(p1, p2);
            out.append(r);

//            if (i < Integer.parseInt(lineCount))
                out.append("\n");
        }
        return out;
    }

    public static int pairRecyclable(int i1, int i2) {
        HashSet<String> hash = new HashSet<String>();
        for (int i = i1; i < i2; i++)
        {
            String istr = String.valueOf(i);
            if (istr.length() < 2) continue;
            for (int p = 0; p < istr.length() ; p++)
            {
                String nistr = istr.substring(p,istr.length()).concat(istr.substring(0,p));
                if (Integer.valueOf(nistr) < i1) continue;
                if (Integer.valueOf(nistr) > i2) continue;
                if (nistr.equals(istr)) continue;
                String cnistr = (Integer.valueOf(nistr) > Integer.valueOf(istr)) ?  istr + "," + nistr : nistr + "," + istr;
                hash.add(cnistr);
            }
        }
        return hash.size();
    }

    public static void main(String[] args) {
        InputStreamReader converter = null;
        try {
            int attempt = 0;
            String quest = "C";
//            String size = "small-attempt";
            String size = "large";
            converter = new InputStreamReader(new FileInputStream("src/resource/"+quest+"-"+size+".in"));
            BufferedReader in = new BufferedReader(converter);
            Round r = new Round();
            String str = r.parse(in).toString();
            System.out.print(str);
            FileOutputStream fos = new FileOutputStream(quest+"-"+size+".out");
            OutputStreamWriter osw = new OutputStreamWriter(fos);
            BufferedWriter bw = new BufferedWriter(osw);
            bw.write(str);
            bw.flush();
            bw.close();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }
}

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Set;

public class Third {

	public static void main(String[] args) {

		try {
			BufferedReader reader = new BufferedReader(new FileReader(new File("input.txt")));
			PrintWriter writer = new PrintWriter(new FileWriter(new File("output.txt")));
			reader.readLine();
			int test = 1;
			String str = "";
			while((str = reader.readLine()) != null){
				long result = 0;
				String[] temp = str.split(" ");
				int a = Integer.parseInt(temp[0]);
				int b = Integer.parseInt(temp[1]);
				boolean[] visited = new boolean[b + 1];
				
				for(int num = a; num <= b; num++){
					if(visited[num]) continue;
					
					int[] digits = GetDigit(num);

					Set<Integer> recycledNum = new HashSet<Integer>();
					for(int i = 0; i < digits.length; i++){
						int thisNum = GetNum(digits, i);
						int thisNumDigit = (int) (Math.log10(thisNum) + 1);
						if(thisNum >= a && thisNum <= b && thisNumDigit == digits.length)
							recycledNum.add(thisNum);
					}
					if(recycledNum.size() > 1){
						result += recycledNum.size() * (recycledNum.size() - 1) / 2;
						Iterator<Integer> iterator = recycledNum.iterator();
						while(iterator.hasNext()){
							visited[iterator.next()] = true;
						}
					}
				}
				writer.println("Case #" + test + ": " + result);
				test++;
			}
			writer.close();
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
	
	private static int[] GetDigit(long num){
		int digits = (int) (Math.log10(num) + 1);
		int[] result = new int[digits];
		while(digits > 0){
			result[--digits] = (int) (num % 10);
			num /= 10;
		}
		return result;
	}
	
	private static int GetNum(int[] digits, int startDigit){
		int number = 0;
		int pos = startDigit;
		do{
			number = number * 10 + digits[pos];
			pos++;
			if(pos >= digits.length) pos -= digits.length;
		} while(startDigit != pos);
		return number;
	}
}
