OMCC 2007 Problem 5

Given two non-negative integers $m>n$ , let's say that $m$ ends in $n$ if we can get $n$ by erasing some digits (from left to right) in the decimal representation of $m$ . For example, 329 ends in 29, and also in 9.

Determine how many three-digit numbers end in the product of their digits.