Codeforces Round 262 (Div. 2)
B
Little Dima and Equation
Codeforces
1500
原题
← AC →
翻译中…

Little Dima misbehaved during a math lesson a lot and the nasty teacher Mr. Pickles gave him the following problem as a punishment.

翻译中…

Find all integer solutions $*x*$ $(0 < *x* < 10^{9})$ of the equation:

翻译中…

$*x* = *b*·*s*(*x*)^{*a*} + *c*,$

翻译中…

where $*a*$, $*b*$, $*c*$ are some predetermined constant values and function $*s*(*x*)$ determines the sum of all digits in the decimal representation of number $*x*$.

翻译中…

The teacher gives this problem to Dima for each lesson. He changes only the parameters of the equation: $*a*$, $*b*$, $*c*$. Dima got sick of getting bad marks and he asks you to help him solve this challenging problem.

翻译中…

Input

翻译中…

The first line contains three space-separated integers: $*a*, *b*, *c*$ $(1 ≤ *a* ≤ 5; 1 ≤ *b* ≤ 10000;  - 10000 ≤ *c* ≤ 10000)$.

翻译中…

Output

翻译中…

Print integer $*n*$ — the number of the solutions that you've found. Next print $*n*$ integers in the increasing order — the solutions of the given equation. Print only integer solutions that are larger than zero and strictly less than $10^{9}$.

翻译中…

样例

Input #1
3 2 8
Output #1
3
10 2008 13726
InputCopy OutputCopy
Input #2
1 2 -18
Output #2
0
InputCopy OutputCopy
Input #3
2 2 -1
Output #3
4
1 31 337 967
InputCopy OutputCopy
题目信息
题号
460B
时间限制
1 s
内存限制
256 MB
标签
暴力
模拟
数学
数论

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。