import java.util.HashSet;
import java.util.Scanner;

public class C {

	static HashSet p = new HashSet();
	static int low;
	static int high;
	int count = 0;

	public static void main(String[] args) {

		Scanner sc = new Scanner(System.in);
		int no = sc.nextInt();

		for (int i = 1; i <= no; i++) {

			p.clear();
			low = sc.nextInt();
			high = sc.nextInt();

			for (int l = low; l <= high; l++) {
				recycle(l);
			}
			System.out.println("Case #" + i + ": " + p.size());

		}
	}

	public static void recycle(int no) {

		String s = Integer.toString(no);
		for (int i = 0; i < s.length(); i++) {
			String rec = s.substring(i) + s.substring(0, i);
			int r = Integer.parseInt(rec);
			if (r != no && r >= low && r <= high) {
				int min = Math.min(r, no);
				int max = Math.max(r, no);
				String a = Integer.toString(min) + "" + Integer.toString(max);
				p.add(a);

			}
		}

	}
}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package codejam;

/**
 *
 * @author Suarabh Agarwal
 */
import java.io.*;
import java.util.Scanner;

public class Main3
{
 public static void main(String args[]) throws FileNotFoundException
  {
  Scanner scan1 = new Scanner(new FileReader("src//codejam///input"));
    //    Scanner  scan1 = new Scanner(new FileReader("input"));
  //Scanner  scan2 = new Scanner(new FileReader("output"));
  //Scanner  scan3 = new Scanner(new FileReader("test.in"));
  PrintWriter out = new PrintWriter("output1.txt");
  String T = scan1.nextLine();
  int test_case = Integer.parseInt(T);
  int count = test_case;
  //int answer = 0;
  while(count>0)
  {
      int A = scan1.nextInt();
      int B = scan1.nextInt();
     
      //System.out.print(a[0]);
      //System.out.print(a[1]);
      //System.out.println(a[2]);
      int answer = 0;
      int count1 = B-A;
      int num = A;
      
      while(count1>=0)
      {
        // System.out.println(num);
      int temp[] = {0,0,0,0,0,0,0};
      temp[0]=  (int) (num / (Math.pow(10, 6)));
      int store = (int) (num - (temp[0] * Math.pow(10, 6)));
      temp[1]=  (int) ( store / Math.pow(10, 5));
      store =   (int) (store - (temp[1] * Math.pow(10, 5)));
      temp[2]=  (int) ( store / Math.pow(10, 4));
      store =   (int) (store - (temp[2] * Math.pow(10, 4)));
      temp[3]=  (int) (store / Math.pow(10, 3));
      store =   (int) (store - (temp[3] * Math.pow(10, 3)));
      temp[4]=  (int) (store / Math.pow(10, 2));
      store =   (int) (store - (temp[4] * Math.pow(10, 2)));
      temp[5]=  (int) (store / 10);
      store =   (int) (store - (temp[5] * 10));
      temp[6]=  (store);
      // System.out.println(temp[5]);
       //  System.out.println(num);

          int size = 0;
           // System.out.print(temp[0]);
           // System.out.print(temp[1]);
           // System.out.println(temp[2]);
          if(temp[0]!=0)size=7;
          else if(temp[1] != 0)
          size = 6;
          else if(temp[2] != 0)
          size = 5;
          else if(temp[3] != 0)
          size = 4;
          else if(temp[4] != 0)
          size = 3;
          else if(temp[5] != 0)
          size = 2;
          else if(temp[6] != 0)
          size = 1;
          int reduce= (7-size);
     //   System.out.println(temp[6]);
        for(int t=0;t<size;t++)
        {
            temp[t]=temp[reduce+t];
        }
           
 //       System.out.print(temp[0]);
  //      System.out.print(temp[1]);
   //      System.out.println(temp[2]);
        int change[] = new int[size];
        int temp1[] = new int[size];
        //int temp2[] = new int[size];
        for(int j=0; j<(size-1); j++)
        {
           temp1[0] = temp[size-1];
            for(int i=1; i<size; i++)
           {
                 temp1[i] = temp[i-1];
           }
         //  System.out.print(temp1[0]);
         //  System.out.println(temp1[1]);

           temp=temp1.clone();
           int num1=0;
           for(int k=0; k<size;k++)
           num1+=temp1[k]*Math.pow(10,(size-1-k));
           change[j]=num1;
         //  System.out.println(num1);
           if(num1>num && num1<=B)
            {
             for(int h=0;h<j;h++)
             {
                 if(num1==change[h])
                 {
                    answer--;
                    break;
                 }
             }
             answer++;
            }
        }
          num++;
          count1--;
      }
      out.println("Case #"+(test_case-count+1)+": "+ answer);
      count--;
  }
  out.close();
  }
  }