import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

import java.io.*;
import java.util.*;
public class q3
{
	public static void main(String []args) throws IOException
	{
		
		
		 PrintWriter pw=new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
	   BufferedReader br=new BufferedReader(new FileReader("input.txt"));
		int arr[]=new int[2];
		int limit=Integer.parseInt(br.readLine());
		String x2;
		int count=0;
		for(int li=1;li<=limit;li++)
	   {count=0;
	   	   x2=br.readLine();
	   	      int j=0;
	   	   StringTokenizer st =new StringTokenizer(x2);
	   	   while (st.hasMoreElements()) {

              String token = st.nextElement().toString();
               arr[j]=Integer.parseInt(token);
                 j++;
           }
           
           for(int a1=arr[0];a1<=arr[1];a1++)
           { 
           	  String x1=String.valueOf(a1);
           	  int l=x1.length();
           	  String final1="";
           	  for(int x=1;x<=(l-1);x++)
		     	{
			
			      final1=x1.substring(l-x,l)+x1.substring(0,l-x);
			          int check=Integer.parseInt(final1);
			      if(a1<check&&check<=arr[1])
			      {
			      	      count++;
			        
			          }
			    }
           	  final1="";
           }    
            
	        pw.println("Case #"+li+": "+count);
	   
	   }
	    pw.close();
	}
}