#include <iostream>
#include <cstdio>
#define mod 1999999973
using namespace std;
long long n,p,x=1;
void putere(long long  p)
{
    if(p==0)return ;
    if(p& 1)
    {
        x=((x%mod)*(n%mod))%mod;
        putere(p-1);
    }
    else
    {
        n=((n%mod)*(n%mod))%mod;
        putere(p>>=1);
    }
}
int main()
{
    freopen ("lgput.in","r",stdin);
    freopen ("lgput.out","w",stdout);
    scanf("%lld%lld",&n,&p);
//putere(p);
//printf("%lld",p);return 0;
for(int i=0;(1<<i)<=p;i++)
{

    if(i==100){printf("fff");return 0;}

    printf("%d ",i);
    if(p&(1<<i))
        x=((x%mod)*(n%mod))%mod;
    n=((n%mod)*(n%mod))%mod;
}
    printf("%lld",x);
    return 0;
}