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.*;
import java.lang.Math.*;
public class gcj3
{
     public static void main(String args[])throws Exception
     {
         //Scanner in=new Scanner(System.in);
         //BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
         //BufferedReader br = new BufferedReader(new FileReader("gcj3.in"));
         //PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("gcj3.out")));
         //PrintWriter pw = new PrintWriter(System.out);
         StringTokenizer st;
         BufferedReader br = new BufferedReader(new FileReader("C:\\Users\\rahul\\Desktop\\gcj3.in"));
         PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("C:\\Users\\rahul\\Desktop\\gcj3.out")));
         int t=Integer.parseInt(br.readLine());
         int ctr=0;
         while(t>0)
         {
             int total=0;
             t--;ctr++;
             st=new StringTokenizer(br.readLine());
             int A=Integer.parseInt(st.nextToken());
             int B=Integer.parseInt(st.nextToken());
             int i,j,k,l;
             int ctr1=0,ctr2=0;
             for(i=A;i<=B;i++)
             {
                 String s=Integer.toString(i);
                 l=s.length();
                 String s1=s;
                 int a[]=new int[l+1];
                 a[0]=-1;
                 for(j=0;j<l;j++)
                 {
                     s1=s1.substring(l-1)+s1.substring(0,l-1);
                     int val=Integer.parseInt(s1);
                     a[j+1]=val;
                 }
                 Arrays.sort(a);
                 for(j=1;j<=l;j++)
                 if(a[j]<=B && a[j]>i && a[j]!=a[j-1])
                     {
                         ctr1++;
                     }
                }
             pw.println("Case #"+ctr+": "+ctr1);   
            }
            pw.flush();
            pw.close();
     }
     
}