import java.util.HashMap;
import java.util.HashSet;
import java.util.Scanner;

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}


import java.io.*;

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

/**
 *
 * @author RockHead
 */
public class Recycle {
    
     public static void main(String args[]) throws FileNotFoundException, IOException
    {
        BufferedReader reader = new BufferedReader(new FileReader("C:\\Users\\RockHead\\Desktop\\C-small-attempt0.in"));
        BufferedWriter writer = new BufferedWriter(new FileWriter("C:\\Users\\RockHead\\Desktop\\Recycle_Sol.txt"));
        int testNo = Integer.parseInt(reader.readLine());
        int count=0;
        for(int i=1;i<=testNo;i++)
        {
            String str=reader.readLine();                
            String[] info=str.split(" ");
            
            int A=Integer.parseInt(info[0]);
            int B=Integer.parseInt(info[1]);
            
            int n=A;
           for(int j=n;j<B;j++)
           {
              int m=j+1;
               for(int k=m;k<=B;k++)
               {
                  // System.out.println("Recycle (" + j +" "+ k  +") "+ isRecycled(Integer.toString(j),Integer.toString(k)));
                   if(isRecycled(Integer.toString(j),Integer.toString(k)))
                    count++;
               }
           } 
            System.out.println("Case #"+ i+": "+count );
            writer.write("Case #"+ i+": "+count);
            writer.newLine();
            count=0;
            
        }
        
        
        reader.close();
        writer.close();
}
     
     
     public static boolean isRecycled(String a,String b)
     {
        //move from the back of a to the front 
         for(int i=a.length();i>0;i--)
         {
             String subOne=a.substring(i);
             String subTwo=a.substring(0,i);
             String newString=subOne+subTwo;
             if(newString.equals(b))
                return true;
         }
         
         return false;
     }
     }
