Factovisors

For a non-negative integer $n$, the factorial function $n!$ is defined as follows:

0! = 1
n! = n * (n-1)!   (n > 0)

We say that $a$ divides $b$ if there exists an integer $k$ such that $k \times a = b$.

Given two non-negative integers $n$ and $m$, determine whether $m$ divides $n!$.

The input consists of several lines. Each line contains two non-negative integers $n$ and $m$, separated by a space, both less than $2^{31}$. Input continues until the end of the file (EOF).

For each input line, print m divides n! if $m$ divides $n!$, and m does not divide n! otherwise, on its own line. Replace m and n with the actual values from the input.