#include <fstream>
#include <cstring>
#include <algorithm>
using namespace std;
ifstream fin ("next.in");
ofstream fout ("next.out");
const int NMAX=1000010;
int long long a[NMAX],c[NMAX];
int main()
{
    int k,r,i;
    char ch;
    ch=fin.get();
    while (ch!='\n')
    {
        if (ch==' ')
        {
           ch=fin.get();
            continue;
        }
        a[++a[0]]=ch-'0';
        ch=fin.get();
    }
    fin>>k;
    reverse(a+1,a+a[0]+1);
    memset (c,0,sizeof (c));
    r=0;
    for (i=a[0];i>=1;i--)
    {
        r=r*10+a[i];
        c[++c[0]]=r/k;
        r=r%k;
    }
    reverse (c+1,c+c[0]+1);
    while (c[c[0]]==0 && c[0]>1)
        c[0]--;
    for (i=c[0];i>=1;i--)
        fout<<c[i];
    fout<<"\n";
    fout<<"rest="<<r;
    return 0;
}