import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.File;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class C {

	public static void main(String[] args) throws Exception{
		new C().solve(args[0]);
	}

	private void solve(String file) throws Exception {
		Scanner s = new Scanner(new File(file));
		int x=s.nextInt();
		for(int i=1;i<=x;i++) {
			int y = calculate(s.nextInt(),s.nextInt());			
			System.out.format("Case #%d: %d\n",i,y);
		}
			
	}

	private int calculate(int a, int b) throws Exception {
		int r = 0;
		for ( int w=a; w<=b ; w++) {
			String A = Integer.toString(w);
			int l = A.length();
			List<Integer> list=new ArrayList<Integer>();
			for(int i=0;i<l;i++) {
				A=A.substring(1)+A.charAt(0);
				int bb = Integer.parseInt(A);
				if ( bb==w ) continue;
				if ( bb<=w ) continue;
				if ( bb>b  ) continue;
				if ( list.contains(bb))continue;
				list.add(bb);
				r++;
			}
		}
		return r;
	}
}
