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;
	}
}

/*
Original template used was test.java from USACO's training pages.

Name: Ante Qu
Problem: Recycled Numbers
Gmail Account: quante0

*/

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

class recycledNumbers {
  public static void main (String [] args) throws IOException {
    // Use BufferedReader rather than RandomAccessFile; it's much faster
    BufferedReader f = new BufferedReader(new FileReader("C-large.in"));
                                                  // input file name goes above
    PrintWriter out = new PrintWriter(new BufferedWriter(new FileWriter("out.txt")));

    int T=Integer.parseInt(f.readLine());
    for(int i=0;i<T;i++)
    {
      out.println("Case #" + (i+1) + ": " + solve(f.readLine()));                           // output result
    }
    out.close();                                  // close the output file
    System.exit(0);                               // don't omit this!
  }
  public static String solve(String source)
  {
      // Use StringTokenizer vs. readLine/split -- lots faster
      StringTokenizer st = new StringTokenizer(source);
      int A = Integer.parseInt(st.nextToken());
      int B = Integer.parseInt(st.nextToken());
      int length = 1 + (int) Math.log10(B);
      int total = 0;
      for (int i = A; i <= B; i++)
      {
          int count = 0;
          int[] k = new int[length+1];
          for (int j = 1; j < length; j++)
              if (withInRange(shift(i, j, length),A,B, i))
                  {
                     k[count] = shift(i,j,length);
                    // System.out.println(shift(i,j,length) + " " + i);
                     count++;
                  }
          Arrays.sort(k, 0, count);
          int countcopy = count;
          for (int j = 1; j < countcopy; j++)
              if (k[j] == k[j-1]) 
                  {
                  count--;
                 // System.out.println("-1");
                  }
          total += count;
      }
      return String.valueOf(total / 2);
  }
  private static boolean withInRange(int x, int A, int B, int i)
  {
      if (x < A) return false;
      if (x > B) return false;
      if (x == i) return false;
      return true;
  }
  private static int shift(int current, int by, int length)
  {
      int power = (int) Math.pow(10, by);
      int shift = (int) Math.pow(10, length - by);
      return (current % power) * shift + current / power;
      
  }
  public static char translateChar(char current)
  {

      if (current == ' ') return ' ';
      if (current == 'a') return 'y';
      if (current == 'b') return 'h';
      if (current == 'c') return 'e';
      if (current == 'd') return 's';
      if (current == 'e') return 'o';
      if (current == 'f') return 'c';
      if (current == 'g') return 'v';
      if (current == 'h') return 'x';
      if (current == 'i') return 'd';
      if (current == 'j') return 'u';
      if (current == 'k') return 'i';
      if (current == 'l') return 'g';
      if (current == 'm') return 'l';
      if (current == 'n') return 'b';
      if (current == 'o') return 'k';
      if (current == 'p') return 'r';
      if (current == 'q') return 'z';
      if (current == 'r') return 't';
      if (current == 's') return 'n';
      if (current == 't') return 'w';
      if (current == 'u') return 'j';
      if (current == 'v') return 'p';
      if (current == 'w') return 'f';
      if (current == 'x') return 'm';
      if (current == 'y') return 'a';
      if (current == 'z') return 'q';
      return '.';
  }
}