#include <bits/stdc++.h>
using namespace std;
template <typename T1, typename T2>
istream& operator>>(istream& in, pair<T1, T2>& a) {
  in >> a.first >> a.second;
  return in;
}
template <typename T1, typename T2>
ostream& operator<<(ostream& out, pair<T1, T2> a) {
  out << a.first << " " << a.second;
  return out;
}
template <typename T, typename T1>
T amax(T& a, T1 b) {
  if (b > a) a = b;
  return a;
}
template <typename T, typename T1>
T amin(T& a, T1 b) {
  if (b < a) a = b;
  return a;
}
const long long INF = 1e18;
const int32_t M = 1e9 + 7;
const int32_t MM = 998244353;
long long power(long long x, unsigned long long y, long long p) {
  long long res = 1;
  x = x % p;
  if (x == 0) return 0;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
vector<bool> prime(M, true);
void sieve(long long n) {
  for (long long i = 2; i * i <= n; i++) {
    if (prime[i] == true) {
      for (long long j = i * i; j <= n; j += i) {
        prime[j] = false;
      }
    }
  }
}
long long digitsum(long long x) {
  long long sum = 0;
  while (x) {
    sum += x % 10;
    x = x / 10;
  }
  return sum;
}
void solve() {
  long long a, b, c;
  cin >> a >> b >> c;
  vector<long long> v;
  long long cnt = 0;
  for (long long i = 1; i <= 81; i++) {
    long long x = b * pow(i, a) + c;
    if (digitsum(x) == i && x < 1e9) {
      cnt++;
      v.push_back(x);
    }
  }
  cout << cnt << endl;
  for (long long i = 0; i < v.size(); i++) {
    cout << v[i] << " ";
  }
  return;
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  long long t = 1;
  while (t--) solve();
  return 0;
}
