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.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;

public class RecycledNumbers {
	
	private static String shiftLeft(String str) {
		
		char first_char = str.charAt(0);
		
		String new_number_str = str.substring(1);
		
		new_number_str += first_char;
		
		return new_number_str;
	}
	
	private static boolean recycled(int num1, int num2) {
		String num1Str = Integer.toString(num1);
		String num2Str = Integer.toString(num2);
		
				
		for(int i = 0; i < num2Str.length() - 1; i++) {
			String newStr2 = shiftLeft(num2Str);
			if(num1Str.equals(newStr2))
				return true;
			
			num2Str = newStr2;
		}
		return false;
	}
	
	private static int numDigits(int number) {
		if(number == 0)
			return 1;
		
		int numDigits = 0;
		while(number != 0) {
			number /= 10;
			numDigits++;
		}
		
		return numDigits;
	}

	public static void main(String[] args) throws IOException {
		  FileInputStream fstream = new FileInputStream("input.txt");
		  DataInputStream in = new DataInputStream(fstream);
		  BufferedReader br = new BufferedReader(new InputStreamReader(in));
		  
		  FileWriter fstreamOut = new FileWriter("output.txt");
		  BufferedWriter out = new BufferedWriter(fstreamOut);
		  
		  String strLine = br.readLine();
		  if(strLine.charAt(strLine.length() - 1) == '\n')
			  strLine = strLine.substring(0, strLine.length() - 1);
		  
		  int numCases = Integer.parseInt(strLine);
		  
		  for(int i = 1; i <= numCases; i++) {
			  strLine = br.readLine();
			  if(strLine.charAt(strLine.length() - 1) == '\n')
				  strLine = strLine.substring(0, strLine.length() - 1);
			  
			  int space = strLine.indexOf(' ');
			  
			  int A = Integer.parseInt(strLine.substring(0, space));
			  int B = Integer.parseInt(strLine.substring(space + 1));
			  
			  //System.out.println(A + " and " + B);
			  
			  int numCase = 0;
			  
			  for(int m = A + 1; m <= B; m++) {
				  for(int n = A; n < m; n++) {
					  if(recycled(n, m)) {
						  //System.out.println("WORKS: " + m + " and " + n);
						  numCase++;
					  }
				  }
			  }
			  
			 out.write("Case #" + i + ": " + numCase);
			 if(i < numCases)
				 out.write("\n");
		  }
		  
		  in.close();
		  br.close();
		  
		  out.close();
	}
}
