import java.io.*;
import java.math.BigInteger;
import java.util.*;

import org.jfree.data.function.PowerFunction2D;

public class r2a
{

	Map numMap = new HashMap();
    int output = 0;

    /**
     * @param args
     */
    public static void main(String[] args)
    {
        r2a mk = new r2a();
        try {
            FileInputStream fstream = new FileInputStream("d:/cjinput.txt");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            String str;
            int i = 0;
            while ((str = br.readLine()) != null) {
            	int begin=0,end = 0;
                i++;
                if (i == 1)
                    continue;
                mk.numMap = new HashMap();
                StringTokenizer strTok = new StringTokenizer(str, " ");
                while (strTok.hasMoreTokens()) {
                	begin =  Integer.parseInt(((String) strTok.nextToken()));
                    end = Integer.parseInt(((String) strTok.nextToken()));
                }

                mk.evaluate(i, begin, end);

            }
            in.close();
        }
        catch (Exception e) {
            System.err.println(e);
        }

    }

    private void evaluate(int rowNum, int begin, int end)
    {
    	output=0;
    	for (int i = begin; i<= end; i++) {
    		if(numMap.containsKey(Integer.valueOf(i)))
    			continue;
    		List l = getPairElems(i);
    		if (l.size() > 0) {
    			Iterator itr = l.iterator();
    			int ctr = 0;
    			ArrayList tempList = new ArrayList();
    			while (itr.hasNext()) {
    				int next = ((Integer)itr.next()).intValue();
    				if (next <= end && next > i) {
    					numMap.put(Integer.valueOf(next), i);
    					tempList.add(next);
    					ctr++;
    				}
    			}
    			ctr = getCounter(ctr+1,2);
/*    			if (tempList.size() > 0 || ctr > 0)
    				System.out.println("DD: " + i + ": " + tempList +" ; ctr = " + ctr);*/
    			output = output + ctr;
    		}
    		
    	}

        String outputStr = "Case #" + (rowNum -1) + ": " + output;
        
        System.out.println(outputStr);
    }

	private int getCounter(int n, int r) {
		int ret = 1;
		int nfactorial =1;
		for (int i = 2; i<=n; i++) {
			nfactorial = i*nfactorial;
		}
		int nrfact =1;
		for (int i = 2; i<=n-r; i++) {
			nrfact = i*nrfact;
		}
		
		return nfactorial/(2*nrfact);
	}

	private ArrayList getPairElems(int num) {
		ArrayList retList = new ArrayList();
		int temp = num;
		if (num/10 == 0)
			return retList;
		
		String str = String.valueOf(num);
		
		int arr[] = new int[str.length()];
		int x = str.length();
		while (temp/10 > 0) {
			arr[x-1] = temp%10;
			temp=temp/10;
			x--;
		}
		arr[0]=temp;
		
		int size = arr.length;
		for (int pos = size -1; pos >0; pos--) {
			if(arr[pos] == 0)
				continue;
			int pairNum = 0;
			int multiplier =1;
			for (int c=0; c < size-1; c++) {
				multiplier = multiplier*10;
			}
			pairNum = pairNum + (arr[pos]*multiplier);
			for(int ctr = pos+1, i=1; i < size; i++,ctr++) {
				if (ctr == size)
					ctr=0;
				if (multiplier!=1)
					multiplier=multiplier/10;
				pairNum = pairNum + (arr[ctr]*multiplier);
			}
			if (pairNum != num)
				retList.add(Integer.valueOf(pairNum));			
		}
		
		return retList;
	}
}

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

import java.util.*;
import java.io.*;

/**
 *
 * @author Aaron
 */
public class GoogleRecycleNum {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
         try
        {
        
            File file = new File ("input.txt");
            
            PrintWriter pw = new PrintWriter (new FileWriter ("output.txt"));               
                                
            if (file.exists ())
            {
                FileReader f_rd = new FileReader (file);
                LineNumberReader l_rd = new LineNumberReader(f_rd);
                String input_s;                
                
                
                
                input_s = l_rd.readLine();
                int num_case;
                
                 if (input_s!= null)
                 {
                    num_case = Integer.parseInt (input_s);
                } else 
                 {
                    throw new IllegalArgumentException("Invalid Input File");
                }

                 
                for (int i = 0; i< num_case;i++)
                {
                    int num_a;
                    int  num_b;
                    input_s = l_rd.readLine();
                    String[] values = input_s.split(" ");
                    int result = 0;
                    
                    num_a = Integer.parseInt(values[0]);
                    num_b = Integer.parseInt(values[1]);
                    for ( int j = num_a; j<= num_b; j++)
                    {
                        result += valid_recycle(j, num_a, num_b);                        
                    }
                    
                    pw.println ("Case #"+ (i+1)+": " + result);   
                }
                
                pw.close();
                
                l_rd.close ();
            }             
        }
        catch (IOException e)
        {
            e.printStackTrace();
        }
        
    }
    static int getNumTen (int input_num)
    {
        int n = 1;
        
        while (input_num/n > 0)
            n *= 10;
        
        return n/10;
    }
    static int valid_recycle (int input_num, int num_a, int num_b)
    {
        int count = 0;
        //try to recycle the number to check if it is valid
        if (input_num < 10)
            return 0;
        //input_num = 1212;
        
        int temp = getNumTen (input_num);
        ArrayList <Integer> result = new ArrayList<Integer> ();
        breakall:       
        for (int n = 10; n <= input_num; n *= 10)
        {
            int upper = input_num/n;
            int lower = input_num%n;
            if (lower == 0 || lower < n/10)
            {
                temp = temp/10;
                continue;
            }
            int n_num = lower*temp + upper;
            
            if (n_num >= num_a && n_num <= num_b && n_num > input_num)
            {
                //System.out.println ("Getnerate " + input_num +  " ==> " + n_num);
                int len = result.size();
                for (int i = 0; i < len; i++)
                {
                    if (n_num == result.get(i))
                    {
                        temp = temp/10;
                        continue breakall;
                    }
                }
                result.add (n_num);
                count++;
            }
            temp = temp/10;
        }
        
        
        return count;        
    }
}
