package Main;

import com.sun.deploy.util.ArrayUtil;
import org.apache.commons.lang3.ArrayUtils;

import java.io.*;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.HashSet;

/**
 * Created with IntelliJ IDEA.
 * User: arran
 * Date: 14/04/12
 * Time: 3:12 PM
 * To change this template use File | Settings | File Templates.
 */
public class Round {
    public StringBuilder parse(BufferedReader in) throws IOException {
        StringBuilder out = new StringBuilder();
        String lineCount = in.readLine();

        for (int i = 1; i <= Integer.parseInt(lineCount); i++)
        {
            out.append("Case #"+i+": ");
            System.err.println("Case #"+i+": ");
            String line = in.readLine();
            String[] splits = line.split(" ");
            int p1 = Integer.valueOf(splits[0]);
            int p2 = Integer.valueOf(splits[1]);
            int r = pairRecyclable(p1, p2);
            out.append(r);

//            if (i < Integer.parseInt(lineCount))
                out.append("\n");
        }
        return out;
    }

    public static int pairRecyclable(int i1, int i2) {
        HashSet<String> hash = new HashSet<String>();
        for (int i = i1; i < i2; i++)
        {
            String istr = String.valueOf(i);
            if (istr.length() < 2) continue;
            for (int p = 0; p < istr.length() ; p++)
            {
                String nistr = istr.substring(p,istr.length()).concat(istr.substring(0,p));
                if (Integer.valueOf(nistr) < i1) continue;
                if (Integer.valueOf(nistr) > i2) continue;
                if (nistr.equals(istr)) continue;
                String cnistr = (Integer.valueOf(nistr) > Integer.valueOf(istr)) ?  istr + "," + nistr : nistr + "," + istr;
                hash.add(cnistr);
            }
        }
        return hash.size();
    }

    public static void main(String[] args) {
        InputStreamReader converter = null;
        try {
            int attempt = 0;
            String quest = "C";
//            String size = "small-attempt";
            String size = "large";
            converter = new InputStreamReader(new FileInputStream("src/resource/"+quest+"-"+size+".in"));
            BufferedReader in = new BufferedReader(converter);
            Round r = new Round();
            String str = r.parse(in).toString();
            System.out.print(str);
            FileOutputStream fos = new FileOutputStream(quest+"-"+size+".out");
            OutputStreamWriter osw = new OutputStreamWriter(fos);
            BufferedWriter bw = new BufferedWriter(osw);
            bw.write(str);
            bw.flush();
            bw.close();
        } catch (IOException e) {
            e.printStackTrace();
        }

    }
}

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;


public class C {
	public static void main(String[] args) {
		// split table
		int split[] = new int[10];
		for (int i = 0; i < split.length; i++) {
			split[i] = (int)Math.pow(10, i);
		}
		
		// read input
		CaseC[] cases = read("C-large.in");
		int front, back, size, m, a, b;
		// calculate each case
		for (CaseC c : cases) {
			// in each case
			size = c.getSize();
			a = c.getA();
			b = c.getB();
			for (int n = a; n <= b; n++) {
				// for each value in range [A, B]
				for (int i = size - 1; i > 0; i--) {
					front = n / split[i];
					back = n % split[i];
					
					if (back < split[i-1]) {
						// ignore case with leading zero(s) in "back" part
						//System.err.printf("Leading zero at position %d in number %d\n", i, n);
						continue;
						
					}
					
					m = back * split[size - i] + front;
					if (m > n && m <= b) {
						c.increment(n, m);
					}
				}
			}
		}
		
		// write output
		writeFile(cases, "C-large.out");
		print("Complete!");
	}
	
	public static void printf(String format, Object... args) {
		System.out.printf(format, args);
	}
	
	public static void print(Object o) {
		System.out.println(o);
	}
	
	public static void writeFile(CaseC[] result, String out) {
		PrintWriter writer = null;
		try {
			writer = new PrintWriter(out);
			for (int i = 0; i < result.length; i++) {
				writer.printf("Case #%d: %s\n", i+1, result[i]);
			}
			writer.flush();
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} finally {
			if (writer != null) {
				writer.close();
			}
		}
	}
	
	public static CaseC[] read(String file) {
		BufferedReader reader = null;
		CaseC[] cases = null;
		try {
			reader = new BufferedReader(new FileReader(file));
			
			// get test case count
			int caseCount = Integer.parseInt(reader.readLine());
			cases = new CaseC[caseCount];
			for (int i = 0; i < cases.length; i++) {
				String[] paramStr = reader.readLine().split(" ");
				cases[i] = new CaseC(Integer.parseInt(paramStr[0]), Integer.parseInt(paramStr[1]));
			}
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} finally {
			if (reader != null) {
				try {
					reader.close();
				} catch (IOException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
			}
		}
		return cases;
	}
}

class CaseC {
	private int a;
	private int b;
	private int size;
	//private int count; 
	private HashSet<String> set; 
	
	public CaseC(int a, int b) {
		this.a = a;
		this.b = b;
		this.size = String.valueOf(b).length();
		this.set = new HashSet<String>();
		//System.out.printf("A=%d, B=%d, Size=%d\n", a, b, size);
	}
	
	public int getA() {
		return a;
	}
	
	public int getB() {
		return b;
	}
	
	public int getSize() {
		return size;
	}

	public void increment(int n, int m) {
		
		String s = n + ":" + m;
		if (set.contains(s)) {
			//System.err.println("Duplicated entry: " + s);
		} else {
			set.add(s);
			//count++;
		}
	}
	
	public int getCount() {
		//return count;
		return set.size();
	}
	
	@Override
	public String toString() {
		return "" + set.size();
	}
}