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

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package Competitiopn;

import java.util.Scanner;


public class RecycledNumbersLarge2 {

    public void solve() {

        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt(), t = 0;
        int count = 0, recy = 0;
        while (t < T) {
            int A = sc.nextInt();
            int B = sc.nextInt();

            int n = A, m = 0;//A â¤ n < m â¤ B

            while (n < B) {
                String nn = String.valueOf(n);
                int digits = nn.length();
                int check[] = new int[digits - 1];
                int j = 1;

                while (j < digits) {
                    String mm = nn.substring(digits - j, digits) + nn.substring(0, digits - j);
                    m = Integer.parseInt(mm);

                    if (m <= B && m > n) {

                        int k = 0;
                        while (k < check.length) {
                            if (check[k] == m) {
                                break;
                            } else if (check[k] == 0) {
                                check[k] = m;
                                break;
                            }


                            ++k;
                        }
                    }
                    ++j;
                }
                count = 0;
                for (int i = 0; i < check.length; ++i) {
                    if (check[i] != 0) {
                        count++;
                    }
                }

                recy += count;


                ++n;

            }
            System.out.println("Case #" + (t + 1) + ": " + recy);
            recy = 0;


            ++t;
        }


    }

    public static void main(String[] args) {

        new RecycledNumbersLarge2().solve();
        /*
         * int n = 12345; int j = 2; String nn = String.valueOf(n); int digits =
         * nn.length(); String mm = nn.substring(digits - j, digits) +
         * nn.substring(0, digits - j);
        System.out.println(mm);
         */
    }
}
