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

public class Recycle {

	private static HashMap<Integer, HashSet<Integer>> map = new HashMap<Integer, HashSet<Integer>>();
	private static HashSet<Integer> toSkip = new HashSet<Integer>();
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner reader = new Scanner(System.in);
		int T = reader.nextInt();
		for (int tc = 1; tc <= T; tc++) {
			int a = reader.nextInt();
			int b = reader.nextInt();
			long before = System.currentTimeMillis();
			int res = doit(a, b);
			System.out.printf("Case #%d: %d\n", tc, res);
			long after = System.currentTimeMillis();
//			System.out.println("time taken: " + (after - before));
		}
	}

	private static int doit(int a, int b) {
		int count = 0;
		HashSet<Integer> skip = new HashSet<Integer>(toSkip);
		for (int i = a; i <= b; i++) {
			if (skip.contains(i))
				continue;
			HashSet<Integer> arr = generate(i);
//			if(arr.size() > 1) {
//				map.put(i, arr);
//			}
			// System.out.println(i + " --> " +
			// Arrays.deepToString(arr.toArray()));
			int temp = 0;
			if (arr.size() > 1) {
				for (int x : arr) {
					if (x >= a && x <= b) {
						temp++;
						skip.add(x);
					}
				}
				count += temp * (temp - 1) / 2;
			}
//			System.out.println("not skipping " + i + " gen: " + arr.size()+ " " + (temp * (temp - 1) / 2));
		}
		return count;
	}

	private static HashSet<Integer> generate(int num) {
		if(map.containsKey(num)) {
			HashSet<Integer> list = map.get(num);
			return list;
		}
		HashSet<Integer> list = new HashSet<Integer>();
		String s = "" + num;
		list.add(num);
		int len = s.length();
		for (int i = 1; i < len; i++) {
			String temp = s.substring(i) + s.substring(0, i);
			// System.out.println("temp: " + temp);
			if (temp.charAt(0) == '0')
				continue;
			int x = Integer.parseInt(temp);
			if( x <= 2000000) {
				list.add(x);
			}
		}
		if(list.size() > 1) {
			map.put(num, list);
		} else {
			toSkip.add(num);
		}
		return list;
	}

}

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();   
			
		}


}
