package codejam;

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

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.Map;
import java.util.HashMap;
import java.util.Iterator;
  
public class Hw3 {

	public static int calNum(int n1, int n2){
	int num = 0;
	int i =0;
	for( i=n1; i<=n2; i++){
		String t = Integer.toString(i);
		int len = t.length();
		String shitString = t;
		//System.out.println("Origin "+ t);

		for(int tt=1; tt<len; tt++){
			String tmpString = shitString.substring(1, len);
			tmpString =tmpString+ shitString.substring(0,1);
			//System.out.println(" shit "+ tmpString);
			shitString = tmpString;
			int tmpNum = Integer.parseInt(shitString);
			if(tmpNum>i && tmpNum>=n1 && tmpNum<=n2)
				num++;
		}
		
	}
	
	return num;
}


	public static void main(String[] args) throws IOException {
		 //String line, ArrayList<Integer> sTree, 

		 
	      FileReader reader = new FileReader("/Users/leyu/Desktop/C.in");   
	      
	      BufferedReader br = new BufferedReader(reader);   
	      String s1 = "";   
	      int count = 0;
	      
//	      
//	      Map<String, Integer> triMap = new HashMap<String, Integer>();
//	      Map<String, Integer> mp0 = new HashMap<String, Integer>();
//	      Map<String, Integer> mpLine = new HashMap<String, Integer>();
//	      
	      int num = 0;
	      s1 = br.readLine();
	      count = Integer.parseInt(s1);
	      for( int i = 0; i<count ; i++){
	    	  s1 = br.readLine();
	    	  String []words = s1.split(" ");	
	    	  int n1 = Integer.parseInt(words[0]);
	    	  int n2 = Integer.parseInt(words[1]);
	    	  num = calNum(n1, n2);
	    	  System.out.println("Case #"+(i+1)+": "+num);
	      }


	       
	     br.close();   
	     reader.close();   
			
		}


}
