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

}

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

import java.util.*;
import java.io.*;
import java.util.logging.Level;
import java.util.logging.Logger;


public class Recycle {

    public static void main(String[] args) throws Exception {
        // TODO code application logic here
        
        
         File file=new File("output.txt"); 
         int cases=0;
       
        int A[]=null,B[]=null;
        int result[]=null;
        int temp=0,digits=0;   
            
            
            
         FileInputStream fr=new FileInputStream("C:\\Users\\Sachin\\Desktop\\C-small-attempt0.in");
         @SuppressWarnings("deprecation")
         StreamTokenizer st=new StreamTokenizer(fr);
         st.eolIsSignificant(false);
         st.whitespaceChars(0,32);
         
          int learn=0,flag=0,j=0;

     while(true)
        {
        flag++;
        
        learn=st.nextToken();
        if(learn==StreamTokenizer.TT_EOF)
            break;

        if(learn==StreamTokenizer.TT_NUMBER&&flag==1)
        {
            cases=(int)st.nval;
            A=new int[cases];
            B=new int[cases];
            result=new int[cases];
        }
            
        if(learn==StreamTokenizer.TT_NUMBER&&flag==2)
            A[j]=(int)st.nval;
        

        else if(learn==StreamTokenizer.TT_NUMBER&&flag==3)
        {
            B[j]=(int)st.nval;
            flag=1;
            j++;
        }
    }
            
     
        for(int i=0;i<cases;i++)
        {
            digits=1;
            result[i]=0;
            while(A[i]/digits!=0)
                digits*=10;
            digits/=10;
            
            temp=A[i];
            if(digits==1)
                result[i]=0;
            else if(digits==10)
                while(temp<=B[i])
                {
                    int o=temp%10,t=temp/10;
                    if((o*10+t)<=B[i]&&(o*10+t)>temp)
                        result[i]++;
                    temp++;
                }
            else 
                while(temp<=B[i])
                {
                    int o=temp%10,t=(temp/10)%10,h=temp/100;
                    if((o*100+h*10+t)<=B[i]&&(o*100+h*10+t)>temp)
                        result[i]++;
                    if((t*100+o*10+h)<=B[i]&&(t*100+o*10+h)>temp)
                        result[i]++;
                    temp++;
                }
                
            
            
            
            
            
        }
        FileWriter fileWritter = new FileWriter(file.getName(),true);
    	BufferedWriter bufferWritter = new BufferedWriter(fileWritter);
        for(int i=0;i<cases;i++)
            bufferWritter.write("Case #"+(i+1)+": "+result[i]+"\n");
        bufferWritter.close();
        
        
        
    }
}
