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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.util.TreeSet;

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

/**
 *
 * @author ikhwan
 */
public class C
{
    public static void main(String []args) throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String input = br.readLine();
        int test = Integer.parseInt(input);
        StringTokenizer token;
        for(int i=1;i<=test;i++)
        {
            String temp = br.readLine();
            token = new StringTokenizer(temp," ");
            String n1 = token.nextToken();
            String m1 = token.nextToken();
            int a=Integer.parseInt(n1),b=Integer.parseInt(m1);
            System.out.println("Case #"+i+": "+run(a,b));
            pool.clear();
        }

        //String k = "102";
        //System.out.println(run(Integer.parseInt(k),988));
    }
    static TreeSet<pair> pool = new TreeSet<pair>();
    public static int run(int A,int B)
    {
        int counter=0;
        int k = B-1;
        for(int i=A;i<k;i++)
        {
            String n = String.valueOf(i);
            for(int j=1;j<n.length();j++)
            {
                String m = leftshift(n,j);
                
                
                if(isRecycled(i,m,B))
                {
                    //System.out.println(n+" "+m);
                    counter++;
                    pool.add(new pair(n,m));
                }
            }
        }

        return counter;
    }

    static boolean isRecycled(int n,String m, int B)
    {
        boolean isRecycled=false;
        
        int mNum = Integer.parseInt(m);
        
        if(n<mNum && mNum<= B)
        {
            pair p=new pair(n+"",m);
            if(!pool.contains(p))
            isRecycled = true;
            //else
            //System.out.println(p.n+" "+p.m);
        }

        return isRecycled;

    }

    public static String leftshift(String number, int times)
    {
        String temp =number;
        for(int i=0;i<times;i++)
        {
            temp = leftshift(temp);
        }

        return temp;


    }

    public static String leftshift(String number)
    {
        StringBuffer hasil=new StringBuffer("");
        hasil.append(number.charAt(number.length()-1));
        hasil.append(number.substring(0,number.length()-1));
        return hasil.toString();
    }


    static class pair implements Comparable<pair>
    {
        String n,m;

        pair(String nn,String mm)
        {
            n=nn;
            m=mm;
        }

        public int compareTo(pair t)
        {
            return (n+m).compareTo((t.n+t.m));
        }
    }
    

}
