/*
 * 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);
        
    }
    }
}

/**
 * 
 */

/**
 * @author Mostafa
 *
 */
public class RecycledNumbers {
	
	public static String traverse(String x) {
		char[] m = x.toCharArray();
		m[0] = x.charAt(1);
		m[1] = x.charAt(0);
		String t = new String(m);
		return t;
	}
	
	public static String traverse1(String x) {
		char[] m = x.toCharArray();
		m[0] = x.charAt(2);
		m[1] = x.charAt(0);
		m[2] = x.charAt(1);
		String t = new String(m);
		return t;
	}
	public static String traverse2(String x) {
		char[] m = x.toCharArray();
		m[0] = x.charAt(1);
		m[1] = x.charAt(2);
		m[2] = x.charAt(0);
		String t = new String(m);
		return t;
	}
	
	public static int renumber(int first, int last) {
		String[] test = new String[last-first+1];
		int i, j;
		int testc = 0;
		int count = 0;
		for (i = first; i<=last; i++) {
			String x = Integer.toString(i);
			test[testc] = x;
			testc++;
		}
		if (test[0].length() == 1) {
			count = 0;
		}
		else if (test[0].length() == 2) {
			for (i=0; i<test.length; i++) {
				for (j = i+1; j<test.length; j++) {
					if (test[i].compareTo(traverse(test[j])) == 0) {
						count++;
					}
				}
			}
		}
		else if (test[0].length() == 3) {
			for (i=0; i<test.length; i++) {
				for (j = i+1; j<test.length; j++) {
					if (test[i].compareTo(traverse1(test[j])) == 0) {
						count++;
					}
					if ((test[i].compareTo(traverse2(test[j])) == 0)) {
						count++;
					}
				}
			}
		}
		return count;
	}
}
