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

}

package tp;
import java.io.*;
public class Numbers
{
    String input[];
    int n,m,g;
    int no;
    int ans[];
    int count=0;
    int j,t_c;
    int a,b;   
    DataInputStream dis=new DataInputStream(System.in);
    FileReader fr;
    BufferedReader br;

    Numbers() throws IOException
    {
        fr= new FileReader("D://D//input2.txt");
        br= new BufferedReader(fr);
    }
    void get() throws IOException // this is input ka process
    {
        String ip=br.readLine();// it will take entire line
        t_c= Integer.parseInt(ip);// taste case

        for(int i=1; i<=t_c; i++)
        {
            ip=br.readLine();
            String ip1[]= ip.split(" ");// split
            a= Integer.parseInt(ip1[0]);
            b= Integer.parseInt(ip1[1]);
            
            count=0;
            
            for(int y=a;y<b;y++)
                for(int z=y+1;z<=b;z++)
                {
                        rotate(y,z); 
               }
           System.out.println("Case #"+i+": "+ count);
        }
    }
    void rotate(int x,int y)
    {   
       int tem=x,c=0;
       while(tem!=0)
       {
           tem=tem/10;
           c++;
       }
       int a1=x;
       for(int i=0;i<c-1;i++)
       {
           
           tem=a1%10;
           a1=a1/10;
           a1+=tem*Math.pow(10,c-1);
           if(a1==y)
           {
                count++;
                return;
           }
       }
        
    }
    
    public static void main(String args[])throws IOException
    {
        Numbers n1=new Numbers();
        n1.get();

    }
    
}
    