#include <bits/stdc++.h>

using namespace std;

unordered_map<long long, int> mp;
const int nax = 4255;

long long dp[nax][nax];
void solve() {
    ifstream cin ("desc.in");
    ofstream cout ("desc.out");
    long long n, k;
    cin >> n >> k;
    vector<long long> divs;
    for (long long i = 1; i * i <= n; ++i) {
        if (n % i == 0) {
            divs.push_back(i);
            if (i * i != n) {
                divs.push_back(n / i);
            }
        }
    }
    assert(divs.size() <= 4255);
    sort(divs.begin(), divs.end());
    for (int i = 0; i < divs.size(); ++i) {
        mp[divs[i]] = i;
    }
    for (int i = 0; i < divs.size(); ++i) {

    }
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    solve();
}