package it.simone.google.code.jam2012;

import java.util.HashSet;
import java.util.Set;

public class RecycledNumber implements GoogleCodeExercise {

	int a = 0;
	int b = 0;
	Set<Couple> distinctCouple = null;
	long maxTime = 0;

	private class Couple {
		int x = 0;
		int y = 0;

		public Couple(int x, int y) {
			this.x = x;
			this.y = y;
		}

		@Override
		public int hashCode() {
			final int prime = 31;
			int result = 1;
			result = prime * result + getOuterType().hashCode();
			result = prime * result + x;
			result = prime * result + y;
			return result;
		}

		@Override
		public boolean equals(Object obj) {
			if (this == obj)
				return true;
			if (obj == null)
				return false;
			if (getClass() != obj.getClass())
				return false;
			Couple other = (Couple) obj;
			if (!getOuterType().equals(other.getOuterType()))
				return false;
			if (x == other.x && y == other.y)
				return true;
			if (x == other.y && y == other.x)
				return true;
			return false;
		}

		private RecycledNumber getOuterType() {
			return RecycledNumber.this;
		}

	}

	@Override
	public String execute(String line) {
		int result = 0;

		String[] data = line.split(" ");
		a = Integer.parseInt(data[0]);
		b = Integer.parseInt(data[1]);
		initialize();

		int n = a;
		//
		while (n <= b) {
			result += analize(n);
			n++;
//			if (n % 1000 == 0)
//				System.out.println(n);
		}

		System.out.println(result);
		return "" + result;
	}

	@Override
	public void initialize() {
		distinctCouple = new HashSet<Couple>();
	}

	private int analize(int number) {
		String numString = "" + number;
		initialize();
		for (int i = 1; i < numString.length(); i++) {
			int m = shift(numString, i);
			if (a <= number && number < m && m <= b) {
				Couple couple=new Couple(number,m);
				if (!distinctCouple.contains(couple))
					distinctCouple.add(couple);
			}
		}
		return distinctCouple.size();
	}

	private int shift(String numString, int posx) {

		String result = null;
		result = "" + numString.substring(posx) + numString.substring(0, posx);

		return Integer.parseInt(result.toString());
	}

}

import java.util.Scanner;


public class C {
	
	
	int A = 0;
	int B = 0;
	int cnt = 0;
	
	public int getDig(int x){
		int temp = x;
		int dig = 0;
		while(temp>0){
			dig++;
			temp/=10;		
		}
		return dig;
		
	}
	
	public int flip(int x, int time){
		int temp = x;
		int base = 1;
		for(int i = 1; i<=time;i++) base*=10; 
		int last = temp %base;
		
		
		for(int i = 1; i<=time; i++) temp/=10;		
		for(int i = 1; i<=getDig(x)-time; i++) last*=10;
		
		int ans = last + temp;	
		return ans;
	}
	
	public void getPair(int x){
		if (x<10) return;
		
		
		int dig = getDig(x);
		
		for (int i = 1; i<=dig-1;i++){
			int next = flip(x,i);
			if (dig!=getDig(A)) continue;
			if (next<x) continue;
			if (next==x) break;
			if (next>B||next<A) continue;
//			System.out.println(x+","+next);
			cnt++;
		}		
		return;
	}
	
	public C(Scanner input){
		int T = input.nextInt();
		for(int tt= 1; tt<=T;tt++){
			
			A =input.nextInt();
			B =input.nextInt();
				
			cnt = 0;

			for(int i = A; i<=B; i++){
				getPair(i);				
			}
			System.out.println("Case #"+tt+": "+cnt);
		}
		
	}
	
	public static void main(String args[]){
		new C(new Scanner(System.in));
	}
}
/*
4
1 9
10 40
100 500
1111 2222


*/