A

#include <bits/stdc++.h>
#define ll long long
using namespace std;

bool solve(ll n,ll m)
{
    ll s=1;
    for(ll i=1;i<=n;i++)
    {
        s=((s%m)*(i%m))%m;
        if(s==0)
            return true;
    }
    return false;
}


int main()
{
    ll n,m;
    while(scanf("%lld %lld",&n,&m)==2)
    {
        if(n==0)
        {
            if(1%m==0)
               printf("%lld divides %lld!\n",m,n);
            else
                printf("%lld does not divide %lld!\n",m,n);
        }
        else if(solve(n,m))
            printf("%lld divides %lld!\n",m,n);
        else
            printf("%lld does not divide %lld!\n",m,n);
    }
}