#include <bits/stdc++.h>
using namespace std;
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());
long long binpow(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = res * a;
    a = a * a;
    b >>= 1;
  }
  return res;
}
pair<long long, long long> len(long long x) {
  long long t = 0, l = 0;
  while (x) {
    t += (x % 10);
    l++;
    x /= 10;
  }
  return {t, l};
}
void solve() {
  long long a, b, c;
  cin >> a >> b >> c;
  vector<long long> res;
  for (long long i = 1; i < 82; i++) {
    long long x = b * binpow(i, a) + c;
    pair<long long, long long> s = len(x);
    if (s.second > 9) break;
    if (s.first == i) res.push_back(x);
  }
  cout << (long long)res.size() << "\n";
  for (long long x : res) cout << x << ' ';
}
signed main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long t = 1;
  for (long long i = 1; i < t + 1; i++) {
    solve();
  }
  cerr << "\nTime elapsed: " << 1000 * clock() / CLOCKS_PER_SEC << "ms\n";
  return 0;
}
