import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;


public class abc {
	public static void main(String args[]) 
	{
		int x ,y,j,k,ans=0;
		int tcount =0;
		try{
			  // Create file 
			  FileWriter fstream = new FileWriter("C-small-attempt4.out");
			  BufferedWriter out = new BufferedWriter(fstream);
			 
		
      
		
		 Scanner myfile;
		try {
			myfile = new Scanner(new FileReader("C-small-attempt4.in"));
				 int testcases = myfile.nextInt();
         while (testcases != 0 || myfile.hasNextInt())  
         {          // Read file content using a while loop
        	 ans =0; 
        	 x = myfile.nextInt();
        	 y = myfile.nextInt();
        	 
        // System.out.println(x + y);
		
		int divby = 1;
		for(k = x;k>=10;k/=10)
		{
			divby = divby *10;
		}
		
		int divdivby = 1;
		for(j=x;j<=y;j++)
		{
			int[] ar = new int[20];
			int itr = 0;
			for(divdivby = divby ; divdivby != 1; divdivby/=10)
		  	
			{
			int m = j % divdivby;
			int n = j /divdivby;
			m  = m *(divby /divdivby)*10;
			m = m+n;
			for(int l=0;l<=itr;l++)
			{
				if(ar[l] == m)
				{	m=0;break;}
				
			}
			if(m!=0)
			{
				ar[itr] = m;
				itr++;
			}
			if(m > j && m <= y && m >= x)
				{
				ans++;
				//System.out.println(m +"-- "+j);
				}
			
			}
		}
		
		
		out.write("Case #"+ ++tcount+": "+ans+"\n");
		
		System.out.println(ans);
		testcases--;
	}

		  
         
         myfile.close();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} // Reading file using Scanner

		out.close();
		}catch (Exception e){//Catch exception if any
			  System.err.println("Error: " + e.getMessage());
			  }
		
		
	}

	
}
