#include <bits/stdc++.h>
using namespace std;
int dig(int n) {
  int res = 0;
  while (n >= 10) {
    res += (n % 10);
    n /= 10;
  }
  res += n;
  return res;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int upper = 1000000000;
  int a, b, c, x = 1, ax = 0;
  vector<int> ans;
  cin >> a >> b >> c;
  for (int i = 1; i < 82; i++) {
    long long temp = b * (pow(i, a)) + c;
    if (dig(temp) == i && (temp > 0 && temp < upper)) {
      ans.push_back(temp);
    }
  }
  cout << ans.size() << "\n";
  for (int i = 0; i < ans.size(); i += 1) {
    cout << ans[i] << " ";
  }
  cout << "\n";
}
