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

import java.io.File;
import java.io.FileInputStream;
import java.util.Scanner;

/**
 *
 * @author imgps
 */
public class C {
    public static void main(String args[]) throws Exception{
        int A,B;
        int ctr = 0;
        int testCases;
        
        Scanner sc = new Scanner(new FileInputStream("C-small-attempt0.in "));
        testCases = sc.nextInt();
        int input[][] = new int[testCases][2];
        for(int i=0;i<testCases;i++)
        {
          //  System.out.print("Enter input A B: ");
            input[i][0] = sc.nextInt();
            input[i][1] = sc.nextInt();
            
        }
  

for(int k=0;k<testCases;k++){
      ctr = 0;
      A = input[k][0];
      B = input[k][1];
        for(int i = A;i<=B;i++){
            int num = i;
            int nMul = 1;
            int mul = 1; 
            int tnum = num/10;
            while(tnum > 0){
                mul = mul *10;
                tnum= tnum/10;
            }
            tnum = num;
            int n = 0;
            while(tnum > 0 && mul >= 10){
                nMul = nMul * 10;
                n = (num % nMul) * mul + (num / nMul);
                mul = mul / 10;
                tnum = tnum / 10;
                for(int m=num;m<=B;m++){
                    
                    if(n == m && m > num){
                        ctr++;
                    }
                }
                
                
                
         
            }
        }
        System.out.println("Case #"+(k+1)+": "+ctr);
        
    }
    }
}

import java.io.BufferedReader;
import java.io.FileReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;

/**
 * Created by IntelliJ IDEA.
 * User: Jack Man
 * Date: Apr 13, 2012
 * Time: 9:12:01 PM
 * To change this template use File | Settings | File Templates.
 */
public class RecycledNum {
    public static void main(String[] args) {


        try {
            String filePath = "c:\\projects\\codejam\\input\\recycled.txt";
            StringBuffer fileData = new StringBuffer();
            BufferedReader reader = new BufferedReader(new FileReader(filePath));
            String strLine;

            Integer inputNum = 0;
            List<String> googlereseList = new ArrayList<String>();
            int line = 0;
            Integer cases = null;
            ArrayList<String> solutions = new ArrayList<String>();
            while ((strLine = reader.readLine()) != null) {
                if (line == 0) {
                    line++;
                    continue;
                }
                //
                String[] inputs = strLine.split(" ");
                int start = Integer.parseInt(inputs[0]);
                int end = Integer.parseInt(inputs[1]);

                int found = 0;
                HashMap<String, Boolean> dupeMap = new HashMap<String, Boolean>();
                for (int i = start; i <= end; i++) {
                    String s = i + "";
                    for (int y = 1;y< s.length();y++) {

                        //System.out.println((s.length()-y);
                        String right = s.substring(s.length()-y);
                        String left = s.substring(0, s.length()-y);
                        //System.out.println("Attempt to shift " + y + " digits from the right of " + s + " (" + left + ")(" + right + ")");
                        String mirror = right + left;
                        //remove leading zeros
                        boolean foundZero = false;
                        char[] chars = mirror.toCharArray();
                        String mirrorEnd = "";
                        for (char c : chars) {
                            if (c == '0' && !foundZero) {
                                continue;
                            }
                            foundZero = true;
                            mirrorEnd+=c;

                        }
                        if (s.length() != mirrorEnd.length()) continue;
                        Integer n = Integer.parseInt(s);
                        Integer m = Integer.parseInt(mirrorEnd);

                        if (n.equals(m)) continue;
                        if (start <= n && n < m && m <= end) {
                            if (dupeMap.get(n + "-" + m) != null) {
                                continue;
                            }
                            found++;
                            //System.out.println("\t[" + found + ":MARK] set of " + n + ", " + m);
                            dupeMap.put(n + "-" + m, true);
                        }


                    }


                }
                  System.out.println("Case #" + line + ": " + found);
                //
                line++;
            }
        } catch (Exception e) {
            e.printStackTrace();
        }
    }
}
