import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

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


import java.io.*;
/**
 *
 * @author Joydeep
 */
public class J3 {
    public static void main(String[] args) throws IOException{
        String test = "150";

        DataInputStream ds = new DataInputStream(new FileInputStream("d:/C-small-attempt0.in"));
        Writer os = new BufferedWriter(new FileWriter("d:/output.txt"));
        int N = Integer.parseInt(ds.readLine());
        for(int i = 1;i<=N;i++)
        {
            int A=0,B=0,l,counter=0,n,m,pairs=0;
            String temp="";
            String output="Case #"+i+": ";
            String AB = ds.readLine()+" ";
            
            l = AB.length();
            for(int j = 0;j<l;j++)
            {
                char c = AB.charAt(j);
                if(c != ' ')
                {
                    temp = temp+c;
                }    
                else
                {
                  if(counter == 0)  
                  {
                      A = Integer.parseInt(temp);
                      temp = "";
                  }
                  else
                  {
                      B = Integer.parseInt(temp);
                      break;
                  }
                  counter++;
                 
                }
            }    

          
           
            for(n = A;n<=B;n++)
            {
                String check3=""+n;
                String part1,part2;
                String[] matches = new String[100];
                int c = 0;

                    String check = ""+n;

                    int l2 = check.length();
                    int p1 = l2-2;
                    int p2 = l2-1;
                    for(int x = 1;x<l2;x++)
                    {
                        if(p1==0)
                        {
                            part1 =""+ check.charAt(0);
                        }
                        else
                        {
                            part1=check.substring(0, p2);
                        }
                        
                      part2 = ""+check.charAt(p2);
                      check = part2+part1;
                      int num = Integer.parseInt(check);
                      if(num>n && num<=B)
                      {
                          int flag = 0;
                          for(int y = 0 ;y<c;y++)
                          {
                              if(check.equals(matches[y]))
                              {
                               flag = 1 ;  
                               break;
                              }
                          }
                          if(flag == 0)
                          {
                              pairs++;
                              matches[c++]=check;
                          }
                      }
                    }
            }
            output = output +pairs;
            os.write(output);
            String newLine = System.getProperty("line.separator");
            os.write(newLine);
        }
        ds.close();
        os.close();
    }
}