Count of integers of length N and value less than K such that they contain digits only from the given set

#1

Input: A[] = {0, 1, 2, 5}, N = 2, K = 21
Output: 5
10, 11, 12, 15 and 20 are the possible numbers


I am not able understand from the above link
Can someone explain in a easy way?