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 gcj;

import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;

class Recycled {
	Scanner sc;
	PrintWriter pw;
	
	int t, a, b, n, m, y;

	Recycled() {
		try {
			sc = new Scanner(new File("C-small-attempt0.in"));
			pw = new PrintWriter(new FileWriter("out-small.txt"));
		} catch (IOException e) {
		}
		
		t = sc.nextInt();
		int caseNum = 1;
		
		while (caseNum <= t) {
			y = 0;
			a = sc.nextInt();
			b = sc.nextInt();
			
			n = a;
			m = b;
			while (n < m) {
				while (m > n) {
					recycle(n, m);
					m--;
				}
				n++;
				m = b;
			}
			pw.println("Case #" + caseNum + ": " + y);
			caseNum++;
		}
		pw.flush();
		pw.close();
	}

	void recycle(int a, int b) {
		char[] n = String.valueOf(a).toCharArray();
		char[] m = String.valueOf(b).toCharArray();
		char[] shifted = null;

		for (int i = n.length - 1; i > 0; i--) {
			shifted = shift(n, i);
			if (equal(shifted, m)) {
				this.y++;
				return;
			}
		}
	}

	private char[] shift(char[] x, int start) {
		char[] ret = new char[x.length];

		int i = start;
		for (int j = 0; j < x.length; j++) {
			if (i < x.length) {
				ret[j] = x[i];
				i++;
			} else {
				i = 0;
				ret[j] = x[i];
				i++;
			}
		}
		return ret;
	}

	boolean equal(char[] a, char[] b) {
		for (int i = 0; i < a.length; i++) {
			if (a[i] != b[i])
				return false;
		}
		return true;
	}

	public static void main(String[] args) {
		new Recycled();
	}

}
