Find the number of ways to select three distinct digits from the set {0,1,2,...,9} if no two consecutive digits can be selected.
How many ways can $r$ nonconsecutive integers be chosen from the first $n$ integers?