Consider sets of natural numbers. Some sets can be sorted in the same order numerically and lexicographically. \{\textbf{2}, \textbf{27}, \textbf{3125}, \textbf{9000}\} is one example of such sets; \{\textbf{2}, \textbf{27}, \textbf{243}\} is not since lexicographic sorting would yield \{\textbf{2}, \textbf{243}, \textbf{27}\}. Your task is to write a program that, for the set of integers in a given range \[\textbf{A}, \textbf{B}\] (i.e. between \textbf{A} and \textbf{B} inclusive), counts the number of non-empty subsets satisfying the above property. Since the resulting number is expected to be very huge, your program should output the number in modulo P given as the input. \InputFile The input consists of multiple datasets. Each dataset consists of a line with three integers \textbf{A}, \textbf{B}, and \textbf{P} separated by a space. These numbers satisfy the following conditions: \textbf{1} ≤ \textbf{A} ≤ \textbf{1000000000}, \textbf{0} ≤ \textbf{B}-\textbf{A} < \textbf{100000}, \textbf{1} ≤ \textbf{P} ≤ \textbf{1000000000}. The end of input is indicated by a line with three zeros. \OutputFile For each dataset, output the number of the subsets in modulo \textbf{P}.