import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

package com.nitrous.codejam;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;

public class CodeJamProblem3 {
	public static void readFile(String inputFile) throws IOException {
		File in = new File(inputFile);
		File dir = in.getParentFile();
		File outFile = new File(dir, in.getName()+".out");
		System.out.println("Output file is "+outFile.getAbsolutePath());
		PrintWriter out = new PrintWriter(outFile);
		BufferedReader reader = new BufferedReader(new FileReader(in));
		
		String line = null;
		
		int testCaseCount = Integer.parseInt(reader.readLine().trim());
		System.out.println("Read count="+testCaseCount);
		for (int testCase = 0 ; testCase < testCaseCount; testCase++) {
			line = reader.readLine();
			
			String[] numStrArr = line.split(" ");
			int min = Integer.parseInt(numStrArr[0]);
			int max = Integer.parseInt(numStrArr[1]);
			int count = 0;
			for (int current = min; current <= max; current++) {
				count += countRecycled(current, max);
			}
			
			out.println("Case #"+(testCase+1)+": "+count);
		}
		out.flush();
		out.close();
	}

	private static int countRecycled(int current, int maxValue) {
		String curAsStr = String.valueOf(current);
		int maxLen = curAsStr.length();
		HashSet<Integer> unique = new HashSet<Integer>();
		for (int len = 1; len < maxLen; len++) {
			String move = curAsStr.substring(0, len);
			String mid = curAsStr.substring(len);
			String newStr = mid + move;
			while (newStr.length() > 1 && newStr.startsWith("0")) {
				newStr = newStr.substring(1);
			}
			int newNum = Integer.parseInt(newStr);
			if (newNum > current && newNum <= maxValue) {
				unique.add(newNum);
			}
		}
		return unique.size();
	}
	
	public static void main (String[] args) throws IOException {
		readFile("D:/workspace/CodeJam/data/C-large.in");
		
	}
}
