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.FileReader;
import java.io.IOException;
import java.util.HashMap;
import java.util.HashSet;

public class Recycled {
	
	public static boolean isRot(String a, String b){
		if(a.length()!=b.length())
			return false;
		if(!a.equals(b)){
			String c = b;
				for(int i=0;i<a.length();i++){
					c = c.charAt(c.length()-1) + "" + c.substring(0,c.length()-1);
					if(a.equals(c))
						return true;
				}
		}else return true;
		return false;
	}
	
	//public static boolean noEsta(Arra)
	
	public static void rots(String a, int in, int f, HashMap<Integer, HashSet<Integer>> mapa) {
		int num = Integer.parseInt(a);
		if(num<10)return;
		if(num>f || num<in)return;
		String c=a;
		for (int i = 0; i < a.length(); i++) {
			c = c.charAt(c.length() - 1) + "" + c.substring(0, c.length() - 1);
			//System.out.println(c);
			int cc= Integer.parseInt(c);
			if(cc>=in && cc<=f&& String.valueOf(cc).length()==a.length() && cc!=num){
//				if(mapa.containsKey(num) && !mapa.get(num).contains(cc)){
//					mapa.put(num,cc);
//					if(!mapa.containsKey(cc))
//						mapa.put(cc, new ArrayList<Integer>());
//					mapa.get(cc).add(num);
//				}
//				else{
//					mapa.put(num, new ArrayList<Integer>());
//					mapa.get(num).add(cc);
//					if(!mapa.containsKey(cc))
//						mapa.put(cc, new ArrayList<Integer>());
//					mapa.get(cc).add(num);
//				}
				if(!mapa.containsKey(num)){
					mapa.put(num, new HashSet<Integer>());
				}
				mapa.get(num).add(cc);
				if(!mapa.containsKey(cc))
					mapa.put(cc, new HashSet<Integer>());
				mapa.get(cc).add(num);
			}else{
				//System.out.println(cc);
			}
		}
	}

	public static void main(String[] args) throws IOException {
		BufferedReader br = new BufferedReader(new FileReader("/home/debian/Descargas/C-small-attempt0.in"));
//		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String input = br.readLine();
		int f = Integer.parseInt(input);
		for (int i = 0; i < f; i++) {
			HashMap<Integer,HashSet<Integer>> mapa = new HashMap<Integer, HashSet<Integer>>();
			input = br.readLine();
			int a = Integer.parseInt(input.split(" ")[0]);
			int b = Integer.parseInt(input.split(" ")[1]);
			for (int k = a; k <=b; k++) {
					//System.out.println("k " + k);
					//System.out.println("l " + l);
					rots("" + k, a,b,mapa);
			}
			int cont =0;
			for(int key: mapa.keySet()){
				cont+=mapa.get(key).size();
			}
			System.out.println("Case #" + (i + 1) + ": " + (cont>>1));
		}
	}

}
