#include <iostream>
 
using namespace std;
 
int main() {
    int n, m;
 
    // Reading input until EOF (End of File)
    while (cin >> n >> m) {
        // Calculate factorial of n
        unsigned long long f = 1;
        for (int i = 1; i <= n; ++i) {
            f *= i;
        }
 
        // Check if m divides n!
        bool d = (n >= m || f % m == 0);
 
        // Output result
        if (d) {
            cout << m << " divides " << n << "!\n";
        } else {
            cout << m << " does not divide " << n << "!\n";
        }
    }
 
    return 0;
}
 

I2luY2x1ZGUgPGlvc3RyZWFtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewogICAgaW50IG4sIG07CgogICAgLy8gUmVhZGluZyBpbnB1dCB1bnRpbCBFT0YgKEVuZCBvZiBGaWxlKQogICAgd2hpbGUgKGNpbiA+PiBuID4+IG0pIHsKICAgICAgICAvLyBDYWxjdWxhdGUgZmFjdG9yaWFsIG9mIG4KICAgICAgICB1bnNpZ25lZCBsb25nIGxvbmcgZiA9IDE7CiAgICAgICAgZm9yIChpbnQgaSA9IDE7IGkgPD0gbjsgKytpKSB7CiAgICAgICAgICAgIGYgKj0gaTsKICAgICAgICB9CgogICAgICAgIC8vIENoZWNrIGlmIG0gZGl2aWRlcyBuIQogICAgICAgIGJvb2wgZCA9IChuID49IG0gfHwgZiAlIG0gPT0gMCk7CgogICAgICAgIC8vIE91dHB1dCByZXN1bHQKICAgICAgICBpZiAoZCkgewogICAgICAgICAgICBjb3V0IDw8IG0gPDwgIiBkaXZpZGVzICIgPDwgbiA8PCAiIVxuIjsKICAgICAgICB9IGVsc2UgewogICAgICAgICAgICBjb3V0IDw8IG0gPDwgIiBkb2VzIG5vdCBkaXZpZGUgIiA8PCBuIDw8ICIhXG4iOwogICAgICAgIH0KICAgIH0KCiAgICByZXR1cm4gMDsKfQo=

NiA5CjYgMjcKMjAgMTAwMDAKMjAgMTAwMDAwCjEwMDAgMTAwOQ==

6 9
6 27
20 10000
20 100000
1000 1009