Problem: Bizon the Champion isn't just friendly, he also is a rigorous coder.

Let's define function f(a), where a is a sequence of integers. Function f(a) returns the following sequence: first all divisors of a1 go in the increasing order, then all divisors of a2 go in the increasing order, and so on till the last element of sequence a. For example, f([2, 9, 1]) = [1, 2, 1, 3, 9, 1].

Let's determine the sequence Xi, for integer i (i ≥ 0): X0 = [X] ([X] is a sequence consisting of a single number X), Xi = f(Xi - 1) (i > 0). For example, at X = 6 we get X0 = [6], X1 = [1, 2, 3, 6], X2 = [1, 1, 2, 1, 3, 1, 2, 3, 6].

Given the numbers X and k, find the sequence Xk. As the answer can be rather large, find only the first 105 elements of this sequence.

Input

A single line contains two space-separated integers — X (1 ≤ X ≤ 1012) and k (0 ≤ k ≤ 1018).

Output

Print the elements of the sequence Xk in a single line, separated by a space. If the number of elements exceeds 105, then print only the first 105 elements.

Examples

Input

6 1


Output

1 2 3 6 


Input

4 2


Output

1 1 2 1 2 4 


Input

10 3


Output

1 1 1 2 1 1 5 1 1 2 1 5 1 2 5 10 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
void pre() {}
set<long long int> pd;
struct primeFactorization {
  long long int countOfPf, primeFactor;
};
vector<long long int> ret;
void generateDivisors(long long int curIndex, long long int curDivisor,
                      vector<primeFactorization>& arr) {
  if (curIndex == arr.size()) {
    ret.push_back(curDivisor);
    return;
  }
  for (int i = 0; i <= arr[curIndex].countOfPf; ++i) {
    generateDivisors(curIndex + 1, curDivisor, arr);
    curDivisor *= arr[curIndex].primeFactor;
  }
}
void generate(long long int n) {
  vector<primeFactorization> oo;
  for (auto i : pd) {
    if (n % i == 0) {
      auto j = 0;
      while (n % i == 0) {
        n /= i;
        j++;
      }
      oo.push_back({j, i});
    }
  }
  generateDivisors(0, 1, oo);
  sort(ret.begin(), ret.end());
}
long long int ans[100001];
int j = 0;
void rec(long long int n, long long int x) {
  if (j == 100000) {
    return;
  }
  if (x == 0) {
    ans[j] = n;
    j++;
    return;
  }
  if (n == 1) {
    ans[j] = 1;
    j++;
    return;
  }
  if (pd.find(n) != pd.end()) {
    for (int i = 0; i < x; i++) {
      if (j == 100000) return;
      ans[j] = 1;
      j++;
    }
    if (j == 100000) return;
    ans[j] = n;
    j++;
    return;
  }
  generate(n);
  auto oops = ret;
  ret.clear();
  for (auto i : oops) {
    rec(i, x - 1);
  }
}
void solve() {
  long long int n, x;
  cin >> n >> x;
  long long int oo = n;
  for (long long int i = 2; i <= sqrt(n); i++) {
    if (oo % i == 0) {
      pd.insert(i);
      while (oo % i == 0) {
        oo /= i;
      }
    }
  }
  if (oo > 1) pd.insert(oo);
  rec(n, x);
  for (int i = 0; i < j; i++) {
    cout << ans[i] << " ";
  }
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  pre();
  solve();
}