import java.io.*;
import java.math.BigInteger;
import java.util.*;

import org.jfree.data.function.PowerFunction2D;

public class r2a
{

	Map numMap = new HashMap();
    int output = 0;

    /**
     * @param args
     */
    public static void main(String[] args)
    {
        r2a mk = new r2a();
        try {
            FileInputStream fstream = new FileInputStream("d:/cjinput.txt");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            String str;
            int i = 0;
            while ((str = br.readLine()) != null) {
            	int begin=0,end = 0;
                i++;
                if (i == 1)
                    continue;
                mk.numMap = new HashMap();
                StringTokenizer strTok = new StringTokenizer(str, " ");
                while (strTok.hasMoreTokens()) {
                	begin =  Integer.parseInt(((String) strTok.nextToken()));
                    end = Integer.parseInt(((String) strTok.nextToken()));
                }

                mk.evaluate(i, begin, end);

            }
            in.close();
        }
        catch (Exception e) {
            System.err.println(e);
        }

    }

    private void evaluate(int rowNum, int begin, int end)
    {
    	output=0;
    	for (int i = begin; i<= end; i++) {
    		if(numMap.containsKey(Integer.valueOf(i)))
    			continue;
    		List l = getPairElems(i);
    		if (l.size() > 0) {
    			Iterator itr = l.iterator();
    			int ctr = 0;
    			ArrayList tempList = new ArrayList();
    			while (itr.hasNext()) {
    				int next = ((Integer)itr.next()).intValue();
    				if (next <= end && next > i) {
    					numMap.put(Integer.valueOf(next), i);
    					tempList.add(next);
    					ctr++;
    				}
    			}
    			ctr = getCounter(ctr+1,2);
/*    			if (tempList.size() > 0 || ctr > 0)
    				System.out.println("DD: " + i + ": " + tempList +" ; ctr = " + ctr);*/
    			output = output + ctr;
    		}
    		
    	}

        String outputStr = "Case #" + (rowNum -1) + ": " + output;
        
        System.out.println(outputStr);
    }

	private int getCounter(int n, int r) {
		int ret = 1;
		int nfactorial =1;
		for (int i = 2; i<=n; i++) {
			nfactorial = i*nfactorial;
		}
		int nrfact =1;
		for (int i = 2; i<=n-r; i++) {
			nrfact = i*nrfact;
		}
		
		return nfactorial/(2*nrfact);
	}

	private ArrayList getPairElems(int num) {
		ArrayList retList = new ArrayList();
		int temp = num;
		if (num/10 == 0)
			return retList;
		
		String str = String.valueOf(num);
		
		int arr[] = new int[str.length()];
		int x = str.length();
		while (temp/10 > 0) {
			arr[x-1] = temp%10;
			temp=temp/10;
			x--;
		}
		arr[0]=temp;
		
		int size = arr.length;
		for (int pos = size -1; pos >0; pos--) {
			if(arr[pos] == 0)
				continue;
			int pairNum = 0;
			int multiplier =1;
			for (int c=0; c < size-1; c++) {
				multiplier = multiplier*10;
			}
			pairNum = pairNum + (arr[pos]*multiplier);
			for(int ctr = pos+1, i=1; i < size; i++,ctr++) {
				if (ctr == size)
					ctr=0;
				if (multiplier!=1)
					multiplier=multiplier/10;
				pairNum = pairNum + (arr[ctr]*multiplier);
			}
			if (pairNum != num)
				retList.add(Integer.valueOf(pairNum));			
		}
		
		return retList;
	}
}

package GoogleCodeJam.ed2012;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.concurrent.Semaphore;

public class QualificationC2012 {

	private String inputFile;
	private String outputFile;

	private BufferedReader reader = null;
	private BufferedWriter writer = null;
	
	
	private static int[] sollutions = null;
	private static int[][] inputs = null;
	
	private int totalSollutions = 0;
	private int currentSollution = 0;
	
	private Semaphore deathSignal = new Semaphore(0);
	private Object synchObject = new Object();
	
	/**
	 * @param args
	 * @throws Exception 
	 */
	public static void main(String[] args) throws Exception {
		QualificationC2012 qualificationC2012 = new QualificationC2012("QualificationC2012.in", "QualificationC2012.out");
		qualificationC2012.run();
	}

	private void run() throws Exception {
		openFiles();
		solve();
		closeFiles();
	}

	private void solve() throws Exception {
		long startTime = System.currentTimeMillis();
		totalSollutions = Integer.valueOf(reader.readLine());
		inputs = new int[totalSollutions][2];
		sollutions = new int[totalSollutions];
		
		for (int i = 0; i<totalSollutions; i++) {
			String[] line = reader.readLine().split(" ");
			inputs[i][0] = Integer.valueOf(line[0]);
			inputs[i][1] = Integer.valueOf(line[1]);
		}
		
		int threadNumber = Runtime.getRuntime().availableProcessors();
		
		for (int i = 0; i<threadNumber; i++) {
			Worker worker = new Worker();
			worker.start();
		}
		
		deathSignal.acquire(threadNumber);
		
		for (int i = 0; i<totalSollutions; i++) {
			writer.write("Case #"+(i+1)+": "+sollutions[i]+"\n");
		}
		long endTime = System.currentTimeMillis();
		System.out.println("Solve time = "+(endTime-startTime));
	}
	

	
	
	public QualificationC2012(String inputFile, String outputFile) {
		this.inputFile = inputFile;
		this.outputFile = outputFile;
	}
	
	private void closeFiles() {
		try {
			reader.close();
			writer.close();
		}
		catch (Exception e) {
			throw new RuntimeException();
		}

	}
	
	private void openFiles() {
		try {
			reader = new BufferedReader(new FileReader(inputFile));
			writer = new BufferedWriter(new FileWriter(outputFile));
		}
		catch (Exception e) {
			throw new RuntimeException("File initialization failed");
		}
	}
	
	private class Worker extends Thread {
		private int[] foundValues = new int[6];	
	
		
		public Worker() {
			
		}
		
		public void run() {
			while (true){
				int currentInput = 0; 
				synchronized (synchObject) {
					currentInput = currentSollution;
					currentSollution++;
					if (currentInput >= totalSollutions) {
						break;
					}
				}
				int a = inputs[currentInput][0];
				int b = inputs[currentInput][1];
				int sum = 0;
				for (int i=a; i<b; i++) {
					sum+=getValidPairs(i,b);
				}
				sollutions[currentInput] = sum;
			}
			deathSignal.release();
		}
		
		private int getValidPairs(int j, int b) {
			int validPairs = 0;
			StringBuilder transformedString = new StringBuilder();
			transformedString.append(j);
			int length = transformedString.length();
			transformedString.append(j);
			
			for (int i=1; i<length; i++) {
				int transformed = Integer.valueOf(transformedString.substring(i, i+length));
				if ((j<transformed) && (transformed<=b) && (!found(transformed,validPairs))) {
					foundValues[validPairs] = transformed;
					validPairs++;
				}
			}
			return validPairs;
		}

		private boolean found(int n, int total) {
			for (int i=0; i<total; i++) {
				if (foundValues[i] == n) {
					return true;
				}
			}
			return false;
		}
	}
}
