阿力选美 1092

Ali will be welcoming Miss Yingbin's face value by 0~9. Now there are a total of 10N welcome ladies in Ali's clubhouse, and the number of welcome ladies for each face value is N.

Now Ali has to pick out N welcome ladies to line up. The beauty of this team is the product of all the welcome ladies. Now how many programs can make this team just beautiful?

Note: If N = 3, M = 0, select 1 1 0 and select 1 0 1 are two schemes, but the choice of 1 1 1 can only be a scheme, that is, the repetition of the scheme is only with the face of Miss Yingbin. The value is related to which welcome lady is irrelevant.

One line contains two integers N, M

One line contains an integer to represent the result

N  <= 50，0 <= M <= 10^9