#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const int N = 100005;
int dx[] = {-1, -1, -1, 0, 0, 1, 1, 1};
int dy[] = {-1, 0, 1, -1, 1, -1, 0, 1};
long long int power(long long int a, long long int b) {
  long long int result = 1;
  while (b > 0) {
    if (b & 1 == 1) {
      result *= a;
    }
    a *= a;
    b /= 2;
  }
  return result;
}
long long int sod(long long int y) {
  if (y == 0) {
    return 0;
  }
  return (y % 10 + sod(y / 10));
}
void testCase() {
  long long int a, b, c;
  cin >> a >> b >> c;
  vector<long long int> answer;
  for (long long int i = 1; i <= 81; i++) {
    long long int x = (b * pow(i, a));
    x += c;
    if (x < 1000000000 && sod(x) == i) {
      answer.push_back(x);
    }
  }
  cout << answer.size() << "\n";
  for (auto itr : answer) {
    cout << itr << " ";
  }
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int t = 1;
  while (t != 0) {
    t--;
    testCase();
  }
  return 0;
}
