/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

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));
		}
	}
}
