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.google.recyclednumbers;

import java.util.Scanner;

import com.google.util.FileUtil;

public class RecycledNumbers {

	public static void main(String[] args) {
		String orgFilePath = "E:\\Google_Jam\\RecycledNumbers\\C-large.in";
		Scanner scanner = FileUtil.openFile(orgFilePath);
		StringBuilder sb = new StringBuilder();
		int caseNum = Integer.valueOf(scanner.nextLine());
		for (int i = 0; i < caseNum; i++) {
			sb.append("Case #" + (i + 1) + ": ");
			int n = 0;
			 int a = scanner.nextInt();
			 int b = scanner.nextInt();
			/*int a = 1111;
			int b = 2222;*/
			if (b <= 20) {
				n = 0;
				sb.append(n);
				sb.append("\n");
				continue;
			} else {
				for (int k = a; k <= b; k++) {
					String left = String.valueOf(k);
					int length = left.length();// ×ó±ßÊýµÄÎ»Êý
					int temp = 0;// ÓÃÓÚ¼ÇÂ¼ÄÜ×ª»»³öÀ´µÄÊýµÄ¸öÊý
					int[] tempCase = new int[20];
					for (int j = 0; j < length; j++) {
						String sub1 = left.substring(0, j + 1);
						String sub2 = left.substring(j + 1, length);
						String newNum = sub2 + sub1;
						int right = Integer.valueOf(newNum);			
						if (right <= b && k < right) {
							if (temp == 0) {
								n++;
								tempCase[temp] = right;
								temp++;
							} else {
								int p;
								for (p = 0; p < temp && tempCase[p] != right; p++);
								if (p == temp) {
									tempCase[temp] = right;
									temp++;
									n++;
								}
							}
							//System.out.println(k + "&&" + right);
							//sb.append(k + "&&" + right);
							//sb.append("\n");
						}
					}
				}
			}
			sb.append(n);
			sb.append("\n");
		}
		FileUtil.writeFile(sb, "RecycledNumbers\\large.in");
	}
}
