#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

int main() {
  long long n, k, p;
  cin >> n >> k >> p;
  vector<long long> ret;
  for(long long i = 1; i * i <= n; i++) {
    if(n%i == 0) {
      if(i <= p && n/i <= k) ret.push_back(n/i);
      if(n/i <= p && i <= k) ret.push_back(i);
    }
  }
  sort(ret.begin(), ret.end());
  ret.erase(unique(ret.begin(), ret.end()), ret.end());
  cout << ret.size() << "\n";
  for(auto out: ret) cout << out << "\n";
}