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

/**
 *
 * @author USER-1
 */
import java.io.*;
public class Main {

    /**
     * @param args the command line arguments
     */

    public static boolean check_recycled(int m,int n)
    {
    int rem=0,div=m;
    Integer k=new Integer(m);
    Integer k1=new Integer(n);
    String g=k.toString();
    String g1=k1.toString();
    int c=0,l=g.length(),l1=g1.length();
    while(c<l)
    {
        int w=0,ml=0;
        String temp="",temp1="";
    while(w<=c)
    {
      temp=String.valueOf(g.charAt(l-w-1))+temp;
      
      w++;
    }
     while(ml<=(l-w-1))
     {
     temp1=temp1+String.valueOf(g.charAt(ml));
     ml++;
     }
    //System.out.println(temp1);
    
    if((temp+temp1).equals(g1))
    {
return true;
    }
    c++;
    }
    return false;
    }


    public static void main(String[] args) {
        // TODO code application logic here
    
    try
    {
    BufferedReader br=new BufferedReader(new FileReader("a1.in.txt"));
    PrintWriter out=new PrintWriter(new FileWriter("out.txt"));
    int t=Integer.parseInt(br.readLine());
    int q=0;
    while(q<t)
    {
    String h[]= br.readLine().split(" ");
    int a=Integer.parseInt(h[0]);
    int b=Integer.parseInt(h[1]),n=0,m=0,p=0;
    //out.println(check_recycled(12345,34512));
    for(int i=a;i<b;i++)
    {
    n=i;
    for(int j=a+1;j<=b;j++)
    {
    m=j;
    if(m>n)
    {
     if(check_recycled(n,m))
     {
     p++;
     
     }

    }
    }
    }
    out.println("Case #"+(q+1)+":"+" "+p);
    q++;
    }
    out.flush();
    }
    catch(Exception e)
    {
    System.out.print(e.toString());


    }

    }

}
