Subsets whose lexicographic order matches

Consider sets of natural numbers. In some sets, sorting the elements by value and sorting their decimal representations lexicographically give the same order. {2, 27, 3125, 9000} is such a set. {2, 27, 243} is not, because lexicographic sorting gives {2, 243, 27}.

Take the set of all integers from $A$ to $B$ inclusive and count the subsets that have this property. The empty set is not counted. The count can grow very large, so print it modulo $P$, which is given in the input.

The input holds several datasets. Each dataset is one line with three integers $A$, $B$, and $P$ separated by a space. They satisfy $1 \le A \le 10^9$, $0 \le B - A < 10^5$, and $1 \le P \le 10^9$.

A line holding three zeros marks the end of the input. Do not process that line.

For each dataset, print the number of subsets modulo $P$ on its own line.