/*
 * 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.util.Scanner;

public class Recycler {

    private Scanner input;

    private int numTests = 0;

    public static void main(String[] args) {
	Scanner inp = new Scanner(System.in);
	int numChar = 0;
	numChar = inp.nextInt();
	Recycler r = new Recycler(inp, numChar);
	r.recycle();
    }

    public Recycler(Scanner inp, int numChar) {
	this.input = inp;
	this.numTests = numChar;
    }

    public void recycle() {
	for (int i = 1; (i <= numTests) && input.hasNextLine(); i += 1) {
	    int base = input.nextInt();
	    int end = input.nextInt();
	    int cycles = this.countCycles(base, end);
	    System.out.println("Case #" + i + ": " + cycles);
	}
    }

    public int countCycles(int start, int end) {
	int total = 0;
	int order = order(start);
	for (int i = start; i < end; i += 1) {
	    for (int j = i + 1; j <= end; j += 1) {
		if (isRecycled(i, j, order)) {
		    total += 1;
		}
	    }
	}
	return total;
    }

    public static boolean isRecycled(int i, int j, int order) {
	int rot = (j / 10) + (order * (j - (10 * (j / 10))));
	while (rot != j) {
	    if (rot == i) {
		return true;
	    }
	    rot = (rot / 10) + (order * (rot - (10 * (rot / 10))));
	}
	return false;
    }

    public static int order(int i) {
	int order = 0;
	while (i > 0) {
	    i /= 10;
	    order += 1;
	}
	int result = 1;
	for (int j = 1; j < order; j += 1) {
	    result *= 10;
	}
	return result;
    }
}
	    
	