链接：https://ac.nowcoder.com/acm/contest/7501/K
来源：牛客网
perfect square number 完全平方数
you can assume that solution always exists,and you should print any one of them.
it can be shown that.
示例1
输入
复制2 1 2
2
1
2输出
复制3 2
3
2说明
a=int(input())
b=int(input())
n=int(input())print((n+1)*a+2*n*b)print(a*2+(n+1)*b)