/*
 * 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.*;
import java.io.*;

public class recycle {
    public static int[] pow10 = {1,10,100,1000,10000,100000,1000000,10000000};

    public static void main(String[] args) throws Throwable {
	Scanner input=new Scanner(new File("recycle.in"));
	PrintWriter out=new PrintWriter(new File("recycle.out"));
	int cases=input.nextInt();
	for(int test=1;test<=cases;test++) {
	    boolean[] visited=new boolean[2000001];
	    int a=input.nextInt();
	    int b=input.nextInt();
	    int rank=0, num=1;
	    int ans=0;
	    for(;num<=a;num*=10,rank++); // rank = #digits
	    for(int i=a;i<=b;i++) {
		if(visited[i]) continue;
		visited[i]=true;
		int temp=i;
		int count=1;
		for(int j=0;j<rank-1;j++) {
		    temp=temp/10+temp%10*pow10[rank-1];
		    if(temp<a || temp>b || visited[temp]) continue;
		    visited[temp]=true;
		    count++;
		    }
		ans+=count*(count-1)/2; //count choose 2
		}
	    out.println("Case #"+test+": "+ans);
	    }
	out.close();
	}
    }