
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

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

import java.io.BufferedReader;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.StringTokenizer;

/**
 *
 * @author hemal
 */
public class Main {

    public static void main(String[] args) {
        try {
            BufferedReader bf = new BufferedReader(new FileReader(System.getProperty("user.dir") + "/src/Recycle/" + "input.in"));
            String s = bf.readLine();
            int t = Integer.parseInt(s);
//            for (int i = 1; i <= t; i++) {
//                int count = 0;
//                String s1 = bf.readLine();
//                String s2[] = s1.split(" ");
//                int a = Integer.parseInt(s2[0]);
//                int b = Integer.parseInt(s2[1]);
//                int size = s2[0].length();
//                System.out.println("size " + size);
//                for (int j = a; i <= b; j++) {
////                    for(int k=0;k<size;k++){
////                        String m=String.valueOf(j).charAt(k)
////                    }
////                    System.out.println(a + "  " + b);
////                    for (int k = 1; k <= size; k++) {
//                        int m = (int) (((j % (Math.pow(10, 1))) * Math.pow(10, size - 1)) + j / Math.pow(10, 1));
//                        System.out.println(m);
//                        m = (int) (((j % (Math.pow(10, 2))) * Math.pow(10, size - 2)) + j / Math.pow(10, 2));
//                        System.out.println(m);
////                        m = (int) (((j % (Math.pow(10, 3))) * Math.pow(10, size - 3)) + j / Math.pow(10, 3));
////                        System.out.println(m);
////                        m = (int) (((j % (Math.pow(10, 4))) * Math.pow(10, size - 4)) + j / Math.pow(10, 4));
////                        System.out.println(m);
////                        if (m > b) {
////                            break;
////                        }
////                    }
//                }
//                System.out.println("Case #" + i + ": " + count);
//            }
            PrintWriter pw = new PrintWriter("output.out");
            pw.println("Omg! It works!");
            ArrayList ar=new ArrayList();
            ar.add("1");
            ar.add("1");
            HashMap hm=new HashMap();
            hm.put("1", 12);
            hm.put("1", 32);
            System.out.println(hm);
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}
