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 qualification.q2;

/**
 * Created by IntelliJ IDEA.
 * User: ofer
 * Date: 14/04/12
 * Time: 18:47
 * To change this template use File | Settings | File Templates.
 */
public class Q2Solver {
    
    public int solve(int n,int s,int p, int[] sums){
        
        int res = 0;
        int surprisesLeft = s;
        for (int sum : sums){
            int div = sum / 3;
            int mod = sum % 3;
            if (div >= p){
                res++;
            }
            else if( p - div == 1){
                if (div > 0 && mod == 0 && surprisesLeft > 0){
                    res++;
                    surprisesLeft--;
                }
                else if (mod > 0){
                    res++;
                }
            }
            else if (p -div ==2 && mod == 2 && surprisesLeft > 0){
                res++;
                surprisesLeft--;
            }
        }
        return res;
    }
}
