#include <bits/stdc++.h>
using namespace std;
int cmp(const void *a, const void *b) { return (*(int *)a) - (*(int *)b); }
int solve(long long x) {
  int sum = 0;
  while (x > 0) {
    sum += x % 10;
    x /= 10;
  }
  return sum;
}
int main() {
  ios_base::sync_with_stdio(0);
  int i;
  int a, b, c;
  long long x;
  long long v[83];
  int aux;
  int cont;
  while (cin >> a >> b >> c) {
    cont = 0;
    for (i = 1; i <= 82; i++) {
      aux = a;
      x = 1;
      while (aux > 0) {
        x *= i;
        aux--;
      }
      x *= b;
      x += c;
      if (x < 1000000000 && solve(x) == i) {
        v[cont++] = x;
      }
    }
    qsort(v, cont, sizeof(long long), cmp);
    cout << cont;
    for (i = 0; i < cont; i++) {
      if (i != 0)
        cout << ' ';
      else
        cout << '\n';
      cout << v[i];
    }
    cout << '\n';
  }
}
