#include <bits/stdc++.h>
using namespace std;
const int N = 10010;
vector<long long> is_prime(N + 1, true);
bool sortinrev(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.first > b.first);
}
bool sortbysecdesc(const pair<int, int> &a, const pair<int, int> &b) {
  return a.second > b.second;
}
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
long long int pow(long long int x, long long int y) {
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res = ((res) * (x));
    res %= N;
    y = y >> 1;
    x = ((x) * (x));
  }
  return res;
}
int powm(int x, int y, int p) {
  int res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long int power(long long int a, long long int b) {
  if (b == 1) return a;
  if (b == 0) return 1;
  long long int m1 = power(a, b / 2);
  if (b % 2) return m1 * m1 * a;
  return m1 * m1;
}
void seive_of_eras(long long n) {
  is_prime[0] = 0;
  is_prime[1] = 0;
  for (long long i = 2; i * i <= n; i++) {
    if (is_prime[i]) {
      for (long long j = i * i; j <= n; j += i) {
        is_prime[j] = false;
      }
    }
  }
}
bool isprime(long long a) {
  if (a <= 1) return false;
  if (a == 2 || a == 3) return true;
  if (a % 2 == 0 || a % 3 == 0) return false;
  for (long long i = 5; i * i <= a; i = i + 6) {
    if (a % i == 0 || a % (i + 2) == 0) return false;
  }
  return true;
}
long long f(long long x) {
  long long s = 0;
  while (x != 0) {
    s += x % 10;
    x /= 10;
  }
  return s;
}
void codeit() {
  long long a, b, c;
  cin >> a >> b >> c;
  vector<long long> v;
  for (long long i = 1; i <= 81; i++) {
    long long s = i;
    long long rhs = b * power(s, a) + c;
    long long sum = f(rhs);
    if (sum == s && rhs < 1e9 && rhs > 0) v.push_back(rhs);
  }
  cout << v.size() << '\n';
  for (long long i = 0; i < v.size(); i++) cout << v[i] << '\n';
  return;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(0);
  long long tt;
  tt = 1;
  for (long long i = 0; i < tt; i++) codeit();
}
