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));
	}
}

import java.io.*;
import java.util.*;
class RecycledNumbers
{
    public static void main(String args[]) throws Exception
    {
        Scanner in = new Scanner(new File("C-small-attempt0.in"));
        int t = Integer.parseInt(in.nextLine());
        for(int x = 1; x <= t; x++)
        {
            String st = in.nextLine();
            int a, b;
            a = Integer.parseInt(st.split(" ")[0]);
            b = Integer.parseInt(st.split(" ")[1]);
            int y = 0;
            if(a >= 10)
            {
                for(int i = a; i < b; i++)
                {
                    int n, m;
                    n = i;
                    String tmp = "" + n;
                    for(m = (n + 1); m <= b; m++)
                    {
                        for(int j = 1; j < tmp.length(); j++)
                        {
                            int tt = getNew(n, j);
                            if(tt == m && ("" + tt).length() == ("" + m).length() && a <= n && n < m && m <= b)
                            y++;
                        }
                    }
                }
            }
            System.out.println("Case #" + x + ": " + y);
        }
    }
    public static int getNew(int n, int a)
    {
        String s = "" + n;
        int  p = s.length() - a;
        String s2 = s.substring(p);
        String s3 = s.substring(0, p);
        s = s2 + s3;
        return Integer.parseInt(s);
    }
}