import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package codejam;
import java.util.*;
import java.io.*;
public class RecycledNumbers{
    public static void main(String[] args) throws Exception
    {
        Scanner input = new Scanner(new File("C:\\temp\\C-small.in"));
        int T = input.nextInt();
        for (int t = 1; t <= T; t++)
        {
        int A = input.nextInt();
        int B = input.nextInt();
        double answer = 0;
        for (int a = A; a <= B; a++)
        {
            String aS = a + "";
            for (int i = aS.length(); i > 1; i--)
            {
                int max = Integer.parseInt(aS.substring(i-1) + aS.substring(0, i-1));
                if (max <= B && max >= A && max != a)
                {
                   answer++;
                }
            }
        }
        System.out.println("Case #" + t + ": " + (int)(answer/2));
    }
    }
    public static String reverse(String s, int i)
    {
        return (i < s.length()) ? s.charAt(s.length()-1-i) + reverse(s, i+1) : "";
    }
}
