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

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
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;
	}
}
