package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

package ex3;

import java.util.ArrayList;
import java.util.Scanner;

public class main {

	public static void main(String[] args) {
		Scanner in = new Scanner(System.in);
		int n = in.nextInt();
		
		for(int i = 0; i < n; i++) {
			int a = in.nextInt();
			int b = in.nextInt();
			ArrayList<Integer> al = new ArrayList<Integer>();
			
			for(int j = 1; j < a; j++) {
				for(int k = j+1; k <= b; k++) {
					int la, lb;
					int tmpa = j; int tmpb = k;
					for(la = 0; tmpa > 0; tmpa/=10)la++;
					for(lb = 0; tmpb > 0; tmpb/=10)lb++;
										
					tmpa = j; tmpb = k;

					while(lb>0){
						tmpa*=10; lb--;
					}
					while(la>0) {
						tmpb*=10; la--;
					}	
										
					if(tmpa+k != tmpb+j && tmpa+k >= a && tmpa+k <= b && tmpb+j >= a && tmpb+j <= b){ 
						int lp = al.indexOf(tmpa+k);
						if(lp > 0 && al.get(lp-1) == tmpb+j) {
							
						} else {
							al.add((tmpa+k));
							al.add((tmpb+j));
						}
					}
				}
			}
			System.out.println("Case #"+(i+1)+": "+(al.size()/2));
		}
	}
}
