package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.util.*;
import java.io.*;


public class problem3
{
    private final Scanner sc;
    private static final boolean debug = true;

    static void debug(Object ... objects)
    {
        if(debug)
            System.err.println(Arrays.toString(objects));        
    }

    problem3()
    {
        sc = new Scanner(new BufferedInputStream(System.in));
    }

    public static void main(String [] args)
    {
        (new problem3()).solve();
    }

    int AA,BB;

    int rot(int b)
    {
        int p=10;
        int cnt=0;
        int maxP = 1;
        int ans = 0;
        while(b/maxP > 0) maxP*=10;
        while(b/p>0)
        {
            int c = b/p + (maxP/p)*(b%p);
            //System.out.println(b+ " " + maxP+" " + c);
            if(c==b) break;
            if(c>b&&c<=BB&&c>=AA) ans++;
            p*=10;
        }
        return ans;
    }
    
    
    void solve()
    {
        int T = sc.nextInt();
        int cs = 0;
        while(cs < T)
        {
            cs++;
            long ans = 0;
            int A = sc.nextInt(), B = sc.nextInt();
            AA=A;BB=B;

            for(int i=A;i<=B;i++)
            {
                ans+=rot(i);
            }

            System.out.println("Case #" + cs+ ": "+ans);
        }

    }
}
