def permutations(arr): if len(arr) <= 1: return [arr] result = [] for i in range(len(arr)): rest = arr[:i] + arr[i+1:] for p in permutations(rest): result.append([arr[i]] + p) return result def solve(A, B, C): digits = [1, 2, 3, 4, 5, 6, 7, 8, 9] results = [] # 生成所有排列 for perm in permutations(digits): # 构造三个三位数 num1 = perm[0] * 100 + perm[1] * 10 + perm[2] num2 = perm[3] * 100 + perm[4] * 10 + perm[5] num3 = perm[6] * 100 + perm[7] * 10 + perm[8] # 检查比例关系 if num1 * B == num2 * A and num1 * C == num3 * A: results.append((num1, num2, num3)) # 按照第一个数字升序排列 results.sort() return results def main(): # 读取输入 A, B, C = map(int, input().split()) # 求解 solutions = solve(A, B, C) # 输出结果 if not solutions: print("No!!!") else: for sol in solutions: print(sol[0], sol[1], sol[2]) if __name__ == "__main__": main()