beecrowd | 1544
# The Last Non-zero Digit

**Timelimit: 8**

By Shahriar Manzoor Bangladesh

In this problem it will be given to you two decimal integer numbers **N**, **M**. You will have to find the last non-zero digit of the ** ^{N}P_{M}**. This means no of permutations of

The input file contains several lines of input. Each line of the input file contains two integers **N** (0 ≤ **N** ≤ 20000000), **M** (0 ≤ **N**). Input is terminated by end-of-file.

For each line of the input file you should output a single digit, which is the last non-zero digit of ** ^{N}P_{M}**. For example, if

Sample Input | Sample Output |

10 10 |
8 |