import java.util.*;
import java.io.*;

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.util.Scanner;
import java.io.*;

public class Pair {
  public static int a, b, l;
  public static boolean inr(String x) {
    int t = Integer.parseInt(x);
    if ((t + "").length() != l) return false;
    if (t <= b && t >= a) {
      return true;
    }
    else return false;
  }
  
  public static String toS(int x) {
    String o = "";
    return o+x;
  }
  
  public static boolean notInT(String[] t, String x, int c) {
    for (int i = 0; i < c; i++) if (t[i].equals(x)) return false;
    return true;
  }
  
  public static int recycle(String s) {
    int count = 0;
    String[] t = new String[l];
    int c = 1;
    t[0] = s;
    for (int i = 0; i < l - 1; i++) {
      String a = s.substring(0, i + 1);
      String b = s.substring(i + 1, l);
      if (notInT(t, b + a, c)) {
        t[c] = b + a;
        c++;
      }
    }
    for (int i = 1; i < c; i++) {
      if (inr(t[i])) count++;
    }
    return count;
  }
  
  public static void main(String args[]) throws IOException {
    int count;
    Scanner in = new Scanner(new File("e:/in.txt"));
    PrintStream out = new PrintStream(new File("e:/out.txt"));
    int n = in.nextInt();
    for (int z = 1; z <= n; z++) {
        count = 0;
        a = in.nextInt();
        b = in.nextInt();
        l = (b + "").length();
        for (int i = a; i <= b; i++) {
          count += recycle(toS(i));
        }
        count /= 2;
        out.println("Case #"+z+": "+count);
    }
  }
}

