#include<iostream>
#include<algorithm>
using namespace std;
const int N = 10000000;
int a[N],i = 0;
void fun(int * a,int n)
{
    a[i++] = n%10;//将个位上的数放入数组的第一个位置 
    a[i++] = n/10%10;//以此类推 
    a[i++] = n/100%10;//以此类推 
}
int main()
{
    int A,B,C,n1,n2,n3,flag,count=0,l = 0;
    cin>>A>>B>>C;
    for(n1 = 123;n1 <= 987;n1++)
    {
    	if(n1%A!=0)
    	continue;
        l = 0;
        flag = 1;
        i = 0;
        if((n1*B)%A==0)
        n2 = n1*B/A;//n2:n1=B:A
        else
        continue;
		if((n1*C)%A==0) 
        n3 = n1*C/A;//n3:n1=C:A
        else
        continue;
        fun(a,n1);
        fun(a,n2);
        fun(a,n3);
        sort(a,a+i);
        for(int j = 0;j < i;j++)
        if(a[j]!=j+1)
        {
        	flag=0;
        	break;
		}
        if(flag == 0)
        continue;
        else 
        {
        count++;
        cout<<n1<<" "<<n2<<" "<<n3;
        cout<<endl;
        }
    }
     if(count == 0)
        cout<<"No!!!";
        return 0;
}