import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;
import static java.util.Collections.*;

public class C{
	Scanner sc=new Scanner(System.in);

	int INF=1<<28;
	double EPS=1e-9;

	int caze, T;
	int A, B;

	void run(){
		T=sc.nextInt();
		for(caze=1; caze<=T; caze++){
			A=sc.nextInt();
			B=sc.nextInt();
			solve();
		}
	}

	void solve(){
		int ans=0;
		for(int n=A; n<=B; n++){
			int digit=(int)(log10(n)+EPS);
			int d=(int)pow(10, digit);
			// debug("n", n);
			for(int m=rot(n, d); m!=n; m=rot(m, d)){
				// debug("m", m);
				if(n<m&&m<=B){
					ans++;
				}
			}
		}
		answer(ans+"");
	}

	int rot(int n, int d){
		return n/10+n%10*d;
	}

	void answer(String s){
		println("Case #"+caze+": "+s);
	}

	void println(String s){
		System.out.println(s);
	}

	void print(String s){
		System.out.print(s);
	}

	void debug(Object... os){
		System.err.println(deepToString(os));
	}

	public static void main(String[] args){
		try{
			System.setIn(new FileInputStream("dat/C-small.in"));
			System.setOut(new PrintStream(new FileOutputStream("dat/C-small.out")));
		}catch(Exception e){}
		new C().run();
		System.out.flush();
		System.out.close();
	}
}

package info.stephenn.codejam2012.qualify;

import java.util.Scanner;

public class C {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int cases = sc.nextInt();
		for (int caseX=1; caseX <= cases; caseX+=1){
			int A = sc.nextInt();
			int B = sc.nextInt();
			System.out.println("Case #"+caseX+": "+doit(A,B));
		}
	}
	
	public static int doit(int A, int B){
		int count=0;
		for (int m = A+1; m <= B; m++){
			for (int n = A; n < m; n++){
				count += isRecycledString(Integer.toString(n), Integer.toString(m));
			}
		}
		return count;
	}
	
	public static int countRecycled(int n, int m){
		int count=0;
		
		System.out.println("countRecycled"+n+","+m);
		
		int split = 10;
		
		while (true){
			
			if (split > n) break;
			
			int front = n/ split;
			int behind = n %split;
			int behindInfront = behind * split;
			int t = behindInfront + front;
			
			if (t ==m){
				System.out.println(""+t+" == "+m+" split"+split+" n"+n);
				count +=1;
			}
			split = split * 10;
		}
		return count;
	}
	
	public static int isRecycledString(String n, String m){
		for (int split =1; split < n.length(); split++){
			String t = n.substring(split) + n.substring(0, split);
			if (t.equals(m))
				return 1;
		}
		return 0;
	}
}