#include <bits/stdc++.h>

using namespace std;

const long long VMIN = 0, VMAX = 1'000'000'000'000'000LL;


bool esteBun(int n) {
    vector<int> prime;
    vector<int> exponenti;
    descompune(n, prime, exponenti);
    
}

int caut_bin() {
    int st = VMIN, dr = VMAX, rez = dr+1;
    while (st <= dr) {
        int m = (st + dr) / 2;
        if(esteBun(m)) {
            rez = m;
            dr = m - 1;
        } else {
            st = m + 1;
        }
    }
    return rez;
}

void descompune(int n, vector<int>& prime, vector<int>& exponenti) {
    int copy = n;
    for (int i = 2; i <= copy; i++) {
        bool folosit = false;
        int putere = 0;
        while (n % i == 0) {
            folosit = true;
            n /= i;
            putere++;
        }
        if(folosit) {
            prime.push_back(i);
            exponenti.push_back(putere);
        }
    }
}

int main() {
    ifstream in("gfact.in");
    ofstream out("gfact.out");

    int P, Q;
    in >> P >> Q;

    vector<int> prime;
    vector<int> exponenti;
    descompune(P, prime, exponenti);
    for (int &v : exponenti) {
        v *= Q;
    }
    
    for (int v : exponenti) {
        cout << v << " ";
    }
    
    return 0;
}