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.
 */

/**
 *
 * @author Madu
 */
import java.io.*;

public class Ex3 {

    
    int m_000000(){
    
    
        
        return 0;
    }
    
    
    public static void main(String[] args) {

        try {

            FileInputStream fstream = new FileInputStream("C:/Users/Madu/Documents/NetBeansProjects/CodeJamR1Ex1/input/A-small-attempt0.in");
            FileOutputStream fout = new FileOutputStream("C:/Users/Madu/Documents/NetBeansProjects/CodeJamR1Ex1/output/out.txt");
            PrintStream printStream = new PrintStream(fout);
            // Get the object of DataInputStream
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            String inputIlne;
            br.readLine();
            //printStream.println ("Output");
            //Read File Line By Line
            int lineNum = 1;
            while ((inputIlne = br.readLine()) != null) {
                // Print the content on the console

                //##########

                String[] AandB = inputIlne.split(" ");
                int A = Integer.parseInt(AandB[0]);
                int B = Integer.parseInt(AandB[1]);
                int ans = 0;

                int num = A;
                System.out.println(B);
                while (num <= B) {


                    if (num < 10) {                       
                        num++;
                        
                    } else if (num < 100) {
                        
                        int xo = num/10;
                        int recycle1 = (num % 10) * 10 + xo;
                        if (A <= num && num < recycle1 && recycle1 <= B) {
                            ans++;
                        }
                        num++;
                        
                    } else if (num < 1000) {


                        int xoo = num / 100;
                        int recycle1 = (num % 100) * 10 + xoo;
                        if (A <= num && num < recycle1 && recycle1 <= B) {
                            ans++;
                        }

                        int xxo = num / 10;
                        int recycle2 = (num % 10) * 100 + xxo;
                        if (A <= num && num < recycle2 && recycle2 <= B) {
                            ans++;
                        }

                        num++;

                    } else if(num < 10000){
                    
                        int m = 0;//using for avoid 1212 
                        
                        int xooo = num / 1000;
                        int recycle3 = (num % 1000) * 10 + xooo;
                        if (A <= num & num < recycle3 & recycle3 <= B) {
                            m = recycle3;
                            ans++;
                        }

                        int xxoo = num / 100;
                        int recycle1 = (num % 100) * 100 + xxoo;
                        if (A <= num & num < recycle1 & recycle1 <= B&recycle1!=m) {
                            m = recycle1;
                            ans++;
                        }

                        int xxxo = num / 10;
                        int recycle2 = (num % 10) * 1000 + xxxo;
                        if (A <= num & num < recycle2 & recycle2 <= B & recycle2!=m) {
                            m =recycle2;
                            ans++;
                        }

                        num++;                        
                    
                    } else if(num < 100000){
                    
                       int m = 0;
                        
                        int xoooo = num / 10000;
                        int recycle3 = (num % 1000) * 10 + xoooo;
                        if (A <= num & num < recycle3 & recycle3 <= B) {
                            m = recycle3;
                            ans++;
                        }
                        int xxooo = num / 1000;
                        int recycle1 = (num % 1000) * 100 + xxooo;
                        if (A <= num & num < recycle1 & recycle1 <= B&recycle1!=m) {
                            m = recycle1;
                            ans++;
                        }
                        int xxxoo = num / 100;
                        int recycle2 = (num % 100) * 1000 + xxxoo;
                        if (A <= num & num < recycle2 & recycle2 <= B&recycle2!=m) {
                            m = recycle2;
                            ans++;
                        }
                        int xxxxo = num / 10;
                        int recycle4 = (num % 10) * 10000 + xxxxo;
                        if (A <= num & num < recycle4 & recycle4 <= B&recycle4!=m) {
                            m = recycle4;
                            ans++;
                        }
                    
                        num++;
                        
                    }else if(num < 1000000){
                    
                    int m = 0;
                        
                        int xoooo1 = num / 100000;
                        int recycle33 = (num % 10000) * 10 + xoooo1;
                        if (A <= num & num < recycle33 & recycle33 <= B) {
                            m = recycle33;
                            ans++;
                        }
                    
                        int xoooo = num / 10000;
                        int recycle3 = (num % 1000) * 100 + xoooo;
                        if (A <= num & num < recycle3 & recycle3 <= B&recycle3!=m) {
                            m = recycle3;
                            ans++;
                        }
                        int xxooo = num / 1000;
                        int recycle1 = (num % 1000) * 1000 + xxooo;
                        if (A <= num & num < recycle1 & recycle1 <= B&recycle1!=m) {
                            m = recycle1;
                            ans++;
                        }
                        int xxxoo = num / 100;
                        int recycle2 = (num % 100) * 10000 + xxxoo;
                        if (A <= num & num < recycle2 & recycle2 <= B&recycle2!=m) {
                            m = recycle2;
                            ans++;
                        }
                        int xxxxo = num / 10;
                        int recycle4 = (num % 10) * 100000 + xxxxo;
                        if (A <= num & num < recycle4 & recycle4 <= B&recycle4!=m) {
                            m = recycle4;
                            ans++;
                        }
                    
                        num++;
                        
                    }else if(num < 10000000){
                    
                    int m = 0;
                        
                    int xoooo11 = num / 1000000;
                        int recycle333 = (num % 100000) * 10 + xoooo11;
                        if (A <= num & num < recycle333 & recycle333 <= B) {
                            m = recycle333;
                            ans++;
                        }
                    
                        int xoooo1 = num / 100000;
                        int recycle33 = (num % 10000) * 100 + xoooo1;
                        if (A <= num & num < recycle33 & recycle33 <= B&recycle33!=m) {
                            m = recycle33;
                            ans++;
                        }
                    
                        int xoooo = num / 10000;
                        int recycle3 = (num % 1000) * 1000 + xoooo;
                        if (A <= num & num < recycle3 & recycle3 <= B&recycle3!=m) {
                            m = recycle3;
                            ans++;
                        }
                        int xxooo = num / 1000;
                        int recycle1 = (num % 1000) * 10000 + xxooo;
                        if (A <= num & num < recycle1 & recycle1 <= B&recycle1!=m) {
                            m = recycle1;
                            ans++;
                        }
                        int xxxoo = num / 100;
                        int recycle2 = (num % 100) * 100000 + xxxoo;
                        if (A <= num & num < recycle2 & recycle2 <= B&recycle2!=m) {
                            m = recycle2;
                            ans++;
                        }
                        int xxxxo = num / 10;
                        int recycle4 = (num % 10) * 1000000 + xxxxo;
                        if (A <= num & num < recycle4 & recycle4 <= B&recycle4!=m) {
                            m = recycle4;
                            ans++;
                        }
                    
                        num++;
                    }

                } //System.out.println(ans);
                    printStream.print("Case #" + lineNum + ": " + ans);
                    lineNum++;
                    printStream.println("");
                
            }


        } catch (Exception e) {
            System.out.println(e.toString());
        }



//        else if(test.length()==4){
//        
//            ans=0;
//            A = Integer.parseInt(test);
//            
//            int num =A;
//            while(num<=B){
//                
//             if(num==1212){num++;continue;}   
//             
//            int xooo = num/1000;    
//            int recycle3 = (num%1000)*10+xooo;
//            if(A<=num&&num<recycle3&&recycle3<=B){
//                ans++;
//            }   
//            
//            int xxoo = num/100;
//            int recycle1 = (num%100)*100+xxoo;
//            if(A<=num&&num<recycle1&&recycle1<=B){
//                ans++;
//            }
//            
//            int xxxo = num/10;
//            int recycle2 = (num%10)*1000+xxxo;
//            if(A<=num&&num<recycle2&&recycle2<=B){
//                ans++;
//            }            
//            
//            num++;
//            
//            }        
//            
//            System.out.println(ans);
//        
//        }

    }
}
