#include <bits/stdc++.h>
  
using namespace std;

#define pb push_back
#define sz(x) int(x.size())
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define cin(v) for (auto& cn : v)  cin >> cn;
#define cout(v) for (auto &cn : v) cout << cn << " ";
#define MOD int(1e9+7)
// #define endl "\n"
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

void Haidy()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    //freopen("input.txt","r",stdin),freopen("output.txt","w",stdout);
#endif
}
 
void solve();
int main()
{
    Haidy();
    int t = 1;
    // cin >> t;
    for(int i = 1;i<=t; i++)
    {
        solve();
    }
    return 0;
}
// int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
// int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};

 
void solve()
{
    ll desired, maxFactor, maxCount;
    cin >> desired >> maxFactor >> maxCount;
    maxFactor = min(maxFactor, desired);
    set<ll > factors;
    for(ll i = 1; i * i <= desired; i++){
        if(desired % i == 0){
            if(i <= maxFactor && desired/i <= maxCount){
                factors.insert(i);
            }
            ll other = desired / i;
            if(other <= maxFactor && desired/other <= maxCount && other != i){
                factors.insert(other);
            }
        }
    }
    cout << factors.size() << endl;
    for(auto &x : factors){
        cout << x << endl;
    }
}