Problem:
 Score : 100 points    Problem Statement You have decided to give an allowance to your child depending on the outcome of the game that he will play now.  The game is played as follows:   There are three "integer panels", each with a digit between 1 and 9 (inclusive) printed on it, and one "operator panel" with a + printed on it.  The player should construct a formula of the form X + Y , by arranging the four panels from left to right. (The operator panel should not be placed at either end of the formula.)  Then, the amount of the allowance will be equal to the resulting value of the formula.   Given the values A, B and C printed on the integer panels used in the game, find the maximum possible amount of the allowance.      Constraints  All values in input are integers.  1 \leq A, B, C \leq 9         Input Input is given from Standard Input in the following format:  A  B  C       Output Print the maximum possible amount of the allowance.        Sample Input 1 1 5 2      Sample Output 1 53  The amount of the allowance will be 53 when the panels are arranged as 52+1 , and this is the maximum possible amount.       Sample Input 2 9 9 9      Sample Output 2 108       Sample Input 3 6 6 7      Sample Output 3 82

Solution (Python):
import sys, os, math, bisect, itertools, collections, heapq, queue

from decimal import Decimal
from collections import defaultdict



sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)


MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    ABC = sorted(il())
    print(ABC[0] + ABC[1] + ABC[2] * 10)


if __name__ == '__main__':
    main()

Solution (Python):
A, B, C = sorted(map(int, input().split()))
print(10*C+B+A)

Solution (Python):
A, B, C = input().split()

ans = []

ans.append(int(A) + int(B+C))
ans.append(int(A) + int(C+B))
ans.append(int(B) + int(A+C))
ans.append(int(B) + int(C+A))
ans.append(int(C) + int(A+B))
ans.append(int(C) + int(B+A))

print(max(ans))

Solution (Python):
print(eval('+'.join(max(a:=input())*9+a)))

Solution (Python):
a,b,c=map(int,input().split())
lst=[a,b,c]
lst=sorted(lst)
print(10*(lst[-1])+sum(lst[:2]))

Solution (Python):
A = list(map(int, input().split()))
A.sort(reverse = True)

print(A[0] * 10 + A[1] + A[2])

Solution (Python):
a=list(map(int,input().split()))
a.sort()
print(a[2]*10+a[0]+a[1])

Solution (Python):
l = list(map(int, input().split())) 
l.sort(reverse=True)
print(l[0]*10+l[1]+l[2])

Solution (Python):
nums = sorted([int(i) for i in input().split()])

print(nums[2]*10 + nums[1] + nums[0])

Solution (Python):


s = sorted(list(map(int, input().split())), reverse=True)

print(eval("{}{} + {}".format(s[0], s[1], s[2])))

Solution (Python):
import statistics

l = list(map(int, input().split()))

print(int(str(max(l))+str(min(l))) +statistics.median(l))

Solution (Python):
def solve():
    x = list(map(int, input().split()))
    x.sort()
    print(x[2] * 10 + x[1] + x[0])


if __name__ == '__main__':
    solve()

Solution (Python):
A,B,C = sorted(map(int,input().split()))[::-1]
print(A*10+B*1+C)

Solution (Python):
A,B,C=map(int,input().split())
ichi=10*A+B+C
two=A+10*B+C
three=C*10+A+B
print(max(ichi,two,three))

Solution (Python):
A, B, C = sorted(list(map(int, input().split(" "))))

print(A+B+10*C)

Solution (Python):
L = list(map(int, input().split()))
L.sort(reverse=True)

print(int(str(L[0])+str(L[1])) + L[2])

Solution (Python):
ABC = list(map(int, input().split()))

ABC.sort(reverse=True)

print(int(''.join(map(str, ABC[:2]))) + int(ABC[-1]))

Solution (Python):
A, B, C = map(int, input().split())
m = max(A, B, C)
print(m * 9 + sum((A, B, C)))

Solution (Python):
a = list(map(int,input().split()))
a = sorted(a,reverse = True)
ans = a[0] * 10 + sum(a[1:])
print(ans)

Solution (Python):
a,b,c= sorted(list(map(int,input().split())))
print(c*10+b+a)

Solution (Python):
def main():
    A, B, C = map(int, input().split())
    nums = [A, B, C]
    nums.sort()
    ans = nums[2]*10 + nums[1] + nums[0]
    print(ans) 
main()

Solution (Python):
a = list( map(int,input().split()) )
a.sort(reverse=True)
print(a[0]*10+a[1]+a[2])

Solution (Python):
n = sorted(map(int, input().split()), reverse=True)
print(int(str(n[0])+str(n[1])) + n[2])

Solution (Python):
A = sorted(list(input().split()),reverse = True)
print(int(A[0]+A[1])+int(A[2]))

Solution (Python):
def main():
    from builtins import int, map, list, print, sorted
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = (lambda: (sys.stdin.readline()).rstrip())
    input_list = (lambda: input().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    abc = sorted(input_number_list())
    print(abc[0] + abc[1] + abc[2] * 10)


if __name__ == '__main__':
    main()

Solution (Python):
a,b,c = sorted([ int(n) for n in input().split() ])
print( 10*c+b+a )

Solution (Python):
A,B,C=sorted(map(int,input().split()))
print(10*C+B+A)

Solution (Python):
A,B,C = sorted(map(int,input().split()))
print(A+B+10*C)

Solution (Python):
x=list(map(int,input().split()))
x.sort()
print(x[0]+x[1]+10*x[2])

Solution (Python):
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7

A,B,C = I()
if max(A,B,C) == A:
    print(A*10+B+C)
elif max(A,B,C) == B:
    print(B*10+A+C)
else:
    print(C*10+A+B)

Solution (Python):
X = list(map(int,input().split()))

X = sorted(X, reverse=True)
print(X[0]*10 + X[1] + X[2])

Solution (Python):
A = [int(i) for i in input().split()]
A.sort()
print(A[2]*10+A[1] + A[0])

Solution (Python):
A,B,C=sorted(map(int,input().split()))
print(10*C+B+A)

Solution (Python):

def limpstr():return list(map(str,input().split()))

l=limpstr()
l.sort(reverse=True)
print(int(l[0]+l[1])+int(l[2]))

Solution (Python):
d = list(map(int, input().split()))
print(max(d) * 9 + sum(d))

Solution (Python):
a, b, c = map(int, input().split())
print(max(a*10+b+c, b*10+c+a, c*10+a+b))

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(c * 10 + b + a)

Solution (Python):
a=list(map(int,input().split()))
a=sorted(a)
print(a[-1]*10+a[1]+a[0])

Solution (Python):
A, B, C = list(input().split())
ans = max(
    int(A) + int(B + C),
    int(A) + int(C + B),
    int(B) + int(A + C),
    int(B) + int(C + A),
    int(C) + int(A + B),
    int(C) + int(B + A))
print(ans)

Solution (Python):
a,b,c = map(int,input().split())
print(max(a,b,c)*9+a+b+c)

Solution (Python):
a = [int(i) for i in input().split()]
a.sort()
ans = ""
ans += str(a[-1])
ans += str(a[-2])
print(a[0] + int(ans))

Solution (Python):
lis = list(map(int, input().split()))

lis = sorted(lis)

print(lis[2]*10+lis[1]+lis[0])

Solution (Python):
a,b,c = sorted(map(int, input().split()))
print(10*c + b + a)

Solution (Python):
a,b,c=map(int,input().split())
x = a+b+c

print(max(max(a,b),c) * 9 + x)

Solution (Python):
A,B,C=map(int,input().split())
D=max(A,B,C)
print(A+B+C+9*D)

Solution (Python):
a = list(map(int, input().split()))
a.sort()
print(a[2]*10 + a[1] + a[0])

Solution (Python):
a,b,c= sorted(map(int,input().split()))
print(c*10+b+a)

Solution (Python):
A_B_C = list(map(int, input().split()))
A_B_C.sort()
print(int(str(A_B_C[2]) + str(A_B_C[1])) + A_B_C[0])

Solution (Python):
a, b, c = input().split()
lst = [a, b, c]
r_lst = sorted(lst, reverse=True)
x = ''.join(n for n in r_lst[:2])
y = ''.join(i for i in r_lst[-1:])
print(int(x)+int(y))

Solution (Python):
num = list(map(int,input().split()))
num.sort(reverse=True)
print(int(str(num[0]) + str(num[1])) + num[2])

Solution (Python):
A,B,C=sorted(map(int,input().split()))
print(10*C+B+A)

Solution (Python):
print(eval("+".join(sorted(input()))+"*10"))

Solution (Python):
A ,B , C = map(int,input().split())
L= [A, B, C]
L = sorted(L)
print(L[2]*10 + L[1] + L[0])

Solution (Python):
l=list(map(int,input().split()))
print(sum(l)+max(l)*9)

Solution (Python):
a,b,c=map(int,input().split())
print(max(a,b,c)*9+a+b+c)

Solution (Python):
a, b, c = map(int, input().split())

x = 10 * a + b + c
y = a + 10 * b + c
z = a + b + 10 * c

ans = max(x, y, z)

print(ans)

Solution (Python):
a,b,c=map(int,input().split())
print(max(10*a+b+c,a+10*b+c,a+b+10*c))

Solution (Python):
A,B,C=sorted(map(int,input().split()))
print(C*10+A+B)

Solution (Python):
A = list(map(int,input().split()))
B = str(sorted(A)[-1])
C = str(sorted(A)[-2])
print(int(B+C)+min(A))

Solution (Python):
a = sorted(list(map(int, input().split())))
print(10*a[2] + a[1] + a[0])

Solution (Python):
A, B, C = map(int, input().split())
mx = max(A, B, C)
if mx == A:
  print(10*A + B + C)
elif mx == B:
  print(10*B + C + A)
else:
  print(10*C + A + B)

Solution (Python):
A, B, C = sorted(map(int, input().split()), reverse=True)
print(10*A+B+C)

Solution (Python):
l = list(map(int,input().split()))

l.sort()

print(l[0]+l[1]+l[2]*10)

Solution (Python):
A,B,C = sorted(input().split())
a = C+B+"+"+A

print(eval(a))

Solution (Python):
a,b,c = map(int, input().split())

print(a+b+c + 9*max(a,b,c))

Solution (Python):
abc = input()
abc_lis_str = abc.split()
abc_lis_int = [int(i) for i in abc_lis_str]
abc_lis = sorted(abc_lis_int, reverse=True)
a = abc_lis[0]
b = abc_lis[1]
c = abc_lis[2]

print( a * 10 + b + c )

Solution (Python):
import sys, re
from math import ceil, floor, sqrt, pi, factorial
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replacement
from bisect import bisect, bisect_left
from functools import reduce
from decimal import Decimal, getcontext

def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N)]
def i_row_list(N): return [i_list() for _ in range(N)]
def s_input(): return input()
def s_map(): return input().split()
def s_list(): return list(s_map())
def s_row(N): return [s_input for _ in range(N)]
def s_row_list(N): return [s_list() for _ in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
def lcm(a, b): return a * b // gcd(a, b)
sys.setrecursionlimit(10 ** 6)
INF = float('inf')
MOD = 10 ** 9 + 7

def main():
    num_list = i_list()

    num_list.sort(reverse=True)

    print(num_list[0]*10+num_list[1]+num_list[2])

if __name__ == '__main__':
    main()

Solution (Python):
a,b,c = map(int,input().split())
n1,n2,n3 = sorted([a,b,c],reverse= True)

print(10*n1 + n2 + n3)

Solution (Python):
lis = list(map(int,input().split()))

max_num = str(max(lis))
lis.pop(lis.index(int(max_num)))

if lis[0] > lis[1]:
    result = int(max_num + str(lis[0])) + lis[1]
else:
    result = int(max_num + str(lis[1])) + lis[0]

print(result)

Solution (Python):
num = list(map(int, input().split()))
num.sort()
ans = num[2]*10+num[1]+num[0]
print(ans)

Solution (Python):
A, B, C = map(int, input().split())
print(max(10*A+B+C, 10*B+C+A, 10*C+A+B))

Solution (Python):
a, b, c = map(int, input().split())

n1, n2, n3 = sorted([a, b, c], reverse=True)

print(10*n1 + n2 + n3)

Solution (Python):
a,b,c=map(int,input().split())
m=min(a,b,c)
M=max(a,b,c)
n=a+b+c-m-M
print(M*10+n+m)

Solution (Python):
l = sorted(list(map(int,input().split())),reverse=True)
print (l[0]*10+l[1]+l[2])

Solution (Python):
A,B,C=map(int,input().split())

X=[A,B,C]

Y=sorted(X,reverse=True)

print(Y[0]*10+Y[1]+Y[2])

Solution (Python):
List=list(map(int,input().split()))
List.sort(reverse=True)
print((List[0]*10+List[1])+List[2])

Solution (Python):






def main():
    a, b, c = map(int, input().split())
    abc = sorted([a, b, c], reverse=True)

    return abc[0] * 10 + abc[1] + abc[2]


print(main())

Solution (Python):
a,b,c = map(int,input().split())

h = a + b + c
i = max(a,b,c)
j = i * 10
print(j + h - i)

Solution (Python):
a,b,c = map(int,input().split())
print(max(10*a+b+c, a+10*b+c, a+b+10*c))

Solution (Python):
ABC = list(map(int,input().split()))

sorted_ABC = sorted(ABC,reverse=True)

S = sorted_ABC[0] * 10 +  sorted_ABC[1] + sorted_ABC[2]

print(S)

Solution (Python):
a = input().split()
a.sort()
b = int(a[2] + a[1])
c = int(a[0])
print(b + c)

Solution (Python):
v = sorted(map(int, input().split()))

print(v[2] * 10 + v[1] + v[0])

Solution (Python):
a,b,c = input().split()

tmp = []
ans = []
tmp.append(a)
tmp.append(b)
tmp = ''.join(tmp)
ans.append(int(tmp)+int(c))

tmp = []
tmp.append(b)
tmp.append(c)
tmp = ''.join(tmp)
ans.append(int(tmp)+int(a))

tmp = []
tmp.append(a)
tmp.append(c)
tmp = ''.join(tmp)
ans.append(int(tmp)+int(b))

tmp = []
tmp.append(c)
tmp.append(a)
tmp = ''.join(tmp)
ans.append(int(tmp)+int(b))

tmp = []
tmp.append(b)
tmp.append(a)
tmp = ''.join(tmp)
ans.append(int(tmp)+int(c))


tmp = []
tmp.append(c)
tmp.append(b)
tmp = ''.join(tmp)
ans.append(int(tmp)+int(a))

print(max(ans))

Solution (Python):
A,B,C=map(int,input().split())
print(max([10*A+B+C,A+10*B+C,A+B+10*C]))

Solution (Python):
abc = sorted(list(map(int, input().split())), reverse=True)
print(abc[0] * 10 + abc[1] + abc[2])

Solution (Python):
a = list(map(int, input().split()))
a.sort(reverse=True)
print(int(str(a[0]) + str(a[1])) + a[2])

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(10 * c + b + a)

Solution (Python):
arr= list(map(int, input().split()))
arr.sort()
print(int(str(arr[2]) + str(arr[1])) + arr[0])

Solution (Python):
l = [int(i) for i in input().split()]
l.sort(reverse=True)
print(l[0]*10 + l[1] + l[2])

Solution (Python):

A = sorted([int(s) for s in input().split()])[::-1]
print(A[0]*10 + A[1] + A[2])

Solution (Python):
a=list(map(int,input().split()))
a.sort()
print(a[0]+a[1]+a[2]*10)

Solution (Python):


A, B, C = map(int, input().split())

ans = 0

ans = max(ans, A*10+B+C)
ans = max(ans, A+B*10+C)
ans = max(ans, A+B+C*10)

print(ans)

Solution (Python):
a,b,c = map(int, input().split())
print(max(a,b,c)*10 - max(a,b,c) + sum([a,b,c]))

Solution (Python):
a,b,c = sorted(map(int,input().split()))
d=str(c)+str(b)
print(a+int(d))

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(10*c+b+a)

Solution (Python):
A, B, C = input().split()
num = sorted([A, B, C], reverse=True)
num1 = int(''.join(num)[:2])
num2 = int(num[2])
print(num1+num2)

Solution (Python):
li=list(map(int,input().split()))
ma=max(li)*10
li.remove(max(li))
li.append(ma)
print(sum(li))

Solution (Python):
A,B,C=sorted(map(int,input().split()),reverse=True)
print(10*A+B+C)

Solution (Python):
L = list(map(int,input().split()))
print(10*max(L)+sum(L)-max(L))

Solution (Python):
li = list(map(int, input().split()))
ans = 0
li.sort()
ans += li[0]+li[1]+li[2]*10
print(ans)

Solution (Python):
a = sorted(map(int, input().split()))
print(a[2]*10+a[1]+a[0])

Solution (Python):

l=list(map(int,input().split()))
l.sort()
print(l[2]*10+l[1]+l[0])

Solution (Python):
a,b,c = sorted(map(int,input().split()))
print(a+b+c*10)

Solution (Python):
abc=list(map(int,input().split()))
abc.sort(reverse=True)
print(abc[0]*10+abc[1]+abc[2])

Solution (Python):
import sys
from itertools import permutations
def input(): return sys.stdin.readline().strip()


def main():
    a, b, c = map(int, input().split())
    ans = 0
    for p, q, r in list(permutations([a, b, c])):
        ans = max(ans, 10 * p + q + r, p + 10 * q + r)
    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
abc=list(map(int,input().split()))
abc.sort(reverse=True)
print(abc[0]*10+abc[1]+abc[2])

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(c*10+b+a)

Solution (Python):
lst =  sorted(list(map(int, input().split())))[::-1]
print(int(str(lst[0])+str(lst[1]))+lst[2])

Solution (Python):
li = list(map(int,input().split()))
li.sort()
print(li[0]+li[1]+li[2]*10)

Solution (Python):
def examA():
    A = LI()
    A.sort()
    ans = A[2]*10+A[1]+A[0]
    print(ans)
    return

def examB():
    ans = 0
    print(ans)
    return

def examC():
    ans = 0
    print(ans)
    return

def examD():
    ans = 0
    print(ans)
    return

import sys,bisect,itertools,heapq,math,random
from copy import deepcopy
from heapq import heappop,heappush,heapify
from collections import Counter,defaultdict,deque
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
def I(): return int(input())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LSI(): return list(map(str,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def SI(): return sys.stdin.readline().strip()
global mod,mod2,inf,alphabet,_ep
mod = 10**9 + 7
mod2 = 998244353
inf = 10**18
_ep = 10**(-12)
alphabet = [chr(ord('a') + i) for i in range(26)]

sys.setrecursionlimit(10**7)

if __name__ == '__main__':
    examA()

"""
142
12 9 1445 0 1
asd dfg hj o o
aidn
"""

Solution (Python):
a,b,c=map(int,input().split())
print(max(a,b,c)*9+sum([a,b,c]))

Solution (Python):
ns=list(map(int,input().split()))
ns.sort()
print(ns[2]*10+ns[1]+ns[0])

Solution (Python):

ABC = list(map(int, input().split()))


ABC.sort(reverse=True)
X = 10 * ABC[0] + ABC[1]
Y = ABC[2]
print(X + Y)

Solution (Python):
A = list(map(int,input().split()))
print(9*max(A)+sum(A))

Solution (Python):
a = list(map(int, input().split()))
a.sort(reverse=True)
print(sum(a) + a[0] * 9)

Solution (Python):
a=list(map(int,input().split()))
b=sorted(a)
c=b[::-1]
d=10*c[0]+c[1]
print(d+b[0])

Solution (Python):
l = list(map(int, input().split()))
l.sort(reverse = True)
print(int(str(l[0]) + str(l[1])) + l[2])

Solution (Python):
num = list(map(int, input().split()))

num.sort(reverse=True)

print(num[0]*10+num[1]+num[2])

Solution (Python):
X=sorted(list(map(int,input().split())))
print(X[2]*10+X[1]+X[0])

Solution (Python):
a,b,c=map(int,input().split())
x=max(a,b,c)
print(x*9+a+b+c)

Solution (Python):
nums = list(map(int, input().split()))
nums.sort(reverse=True)
ans = nums[0] * 10 + sum(nums[1:])
print(ans)

Solution (Python):
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

I = list(map(int, input().split()))
I.sort(reverse=True)
print(I[0] * 10 + sum(I[1:3]))

Solution (Python):
nums = list(map(int, input().split()))
nums.sort(reverse=True)
ans = nums[0] * 10 + sum(nums[1:])
print(ans)

Solution (Python):
arrtemp = []

A, B, C = map(int,input().split())
arrtemp.append(A)
arrtemp.append(B)
arrtemp.append(C)

print(max(arrtemp)*10+sorted(arrtemp)[1]+min(arrtemp))

Solution (Python):
def main():
    numbers = list(map(int, input().split()))

    numbers = sorted(numbers)[::-1]

    print(int(str(numbers[0]) + str(numbers[1])) + numbers[2])

if __name__ == '__main__':
    main()

Solution (Python):
a,b,c=map(int,input().split())
print(10*max(a,b,c)+a+b+c-max(a,b,c))

Solution (Python):
x, y, z = map(int, input().split())
i = x + y + z
print(max(x, y, z)* 10 + i - max(x, y, z))

Solution (Python):
A = list(map(int,input().split()))

A.sort(reverse = True)

print(int(str(A[0])+str(A[1]))+A[2])

Solution (Python):
s = list(input().split())
s = sorted(s,reverse = True)
print(int(''.join(s[:2]))+int(s[2]))

Solution (Python):
a, b, c = map(int, input().split())

m = max([a, b, c])
ans = m * 10 + (a + b + c - m)
print(ans)

Solution (Python):
a,b,c=sorted(map(int,input().split()))
print(c*10 + a + b)

Solution (Python):
a = sorted(map(int, input().split()))
print(a[2]*10+a[1]+a[0])

Solution (Python):
a=[int(x) for x in input().split()]

a=sorted(a,reverse=True)

print(10*a[0]+a[1]+a[2])

Solution (Python):
A, B, C = map(int, input().split())
num_list = [A, B, C]
num_list.sort()
print(num_list[2]*10+num_list[1]+num_list[0])

Solution (Python):
a,b,c=sorted(map(int,input().split()))
print(c*10+b+a)

Solution (Python):
L=sorted(list(map(str,input().split())))
print(int(L[2]+L[1])+int(L[0]))

Solution (Python):
A = list(map(int, input().split()))
A.sort()

ans = A[0] + A[1] + 10 * A[2]
print(ans)

Solution (Python):
A,B,C=sorted(map(int,input().split()))
print(10*C+B+A)

Solution (Python):
import sys
import math
import numpy as np
import copy

def main():
    a, b, c = map(int, input().split())
    x = sorted([a, b, c])
    print(10*x[2]+x[1]+x[0])

    return 0

if __name__ == '__main__':
    sys.exit(main())

Solution (Python):
a,b,c = map(int, input().split())
l = [a,b,c]
l = sorted(l)
print(l[-1]*10 + l[-2] + l[-3])

Solution (Python):
a = list(map(int, input().split()))
a = sorted(a, reverse = True)
print(10 * a[0] + a[1] + a[2])

Solution (Python):
a = sorted(map(int, input().split()), reverse=True)
print(a[0] * 10 + a[1] + a[2])

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18


num = Ss()
num.sort(reverse=True)
ans = int("".join(num[:2])) + int(num[-1])
print(ans)

Solution (Python):
a, b, c = sorted(map(int, input().split()))
print(c * 10 + b + a)

Solution (Python):
num_list = list(map(int,input().split()))
max_num = max(num_list)
f_max = 0
sum_result = 0
for i in num_list:
	if i == max_num and f_max == 0:
		sum_result = sum_result + 10 * i
		f_max = 1
	else:
		sum_result = sum_result + i
		
print(sum_result)

Solution (Python):
a, b, c = map(int, input().split())
list_abc = [a, b, c]
list_abc.sort(reverse=True)
ans = int(str(list_abc[0]) + str(list_abc[1])) + list_abc[2]
print(ans)

Solution (Python):
a, b, c = list(map(int, input().split()))

print(10 * max([a, b, c]) + sum([a, b, c]) - max([a, b, c]))

Solution (Python):
s = "".join(input().split())
print(max(int(s[1:])+int(s[0]),int(s[:2])+int(s[-1]),int(s[-1]+s[0])+int(s[1])))

Solution (Python):
a, b, c = map(int, input().split())
if a >= b and a >= c:
    print(int(str(a)+str(b)) + c)
elif b >= a and b >= c:
    print(int(str(b)+str(a)) + c)
else:
    print(int(str(c)+str(a)) + b)

Solution (Python):
numbers = [int(x) for x in input().split()]
numbers.sort(reverse=True)

print(10 * numbers[0] + numbers[1] + numbers[2])

Solution (Python):
a = sorted(input().split() ,reverse=True)
print(int(a[0]+a[1]) + int(a[2]))

Solution (Python):
L = sorted(map(int, input().split()))
print(L.pop() * 10 + sum(L))

Solution (Python):
l = list(map(int,input().split()))
l.sort()
print(l[2]*10+l[1]+l[0])

Solution (Python):
def ii():return int(input())
def iim():return map(int,input().split())
def iil():return list(map(int,input().split()))
def ism():return map(str,input().split())
def isl():return list(map(str,input().split()))

A = iil()
A.sort()

print(A[0]+A[1]+10*A[2])

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)





A,B,C = inputIL()

print(A+B+C+max(A,B,C)*9)

Solution (Python):
a, b, c = map(int, input().split())
m = max(a, b, c)
print(m*10+(a+b+c-m))

Solution (Python):
A = sorted( list(map(int, input().split() ) ) )
print( A[0] + A[1] + 10*A[2] )

Solution (Python):
inf = 10**15
mod = 10**9+7
a,b,c = map(int, input().split())
ans = max(a*10+b+c, b*10+a+c, c*10+b+a)
print(ans)

Solution (Python):
values = list(map(int, input().split(' ')))

m = max(values)
values.remove(m)

print(10 * m + sum(values))

Solution (Python):
a,b,c = sorted(map(int, input().split()))
print(10 * c + b + a)

Solution (Python):
a, b, c = map(int, input().split())
print(max(10*a + b + c, a + 10*b + c, a + b + 10*c))

Solution (Python):
a,b,c = sorted(map(int, input().split()))
print((c*10)+b+a)

Solution (Python):
A, B, C = sorted(map(int, input().split()))
print(10*C+B+A)

Solution (Python):
a, b, c = map(int, input().split())
print(a + b + c + max(a, b, c)*9)

Solution (Python):
a,b,c=map(int,input().split())
print(a+b+c+max(a,b,c)*9)

Solution (Python):
a=sorted(list(map(int,input().split())))
a[2]*=10
print(sum(a))

Solution (Python):


import sys






















def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    L = lmi()
    L.sort(reverse=True)
    print(L[0] * 10 + L[1] + L[2])



if __name__ == "__main__":
    main()

Solution (Python):
a,b,c=map(int,input().split())
s=a+b+c
print(max(a,b,c)*10+s-max(a,b,c))

Solution (Python):
A,B,C = map(int,input().split())
print(max(10*A+B+C,10*B+C+A,10*C+A+B))

Solution (Python):
def ABC_110_A():
    A,B,C = map(int, input().split())
    print(max(A*10+B+C,A+B*10+C,A+B+C*10))

if __name__ == '__main__':

    ABC_110_A()

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    a,b,c=map(int, input().split())
    print(max(a*10+b+c,b*10+a+c,c*10+a+b))
resolve()

Solution (Python):
a,b,c=sorted(list(map(int,input().split())),reverse=True)
print(10*a+b+c)

Solution (Python):
l=list(map(int,input().split()))
l.sort(key=int)
print(int(str(l[-1])+str(l[-2]))+l[0])

Solution (Python):
a=list(map(int,input().split()))
a.sort()
print(a[0]+a[1]+a[2]*10)

Solution (Python):
a = list(map(int,input().split()))
a = sorted(a)
x = a[2] * 10 + a[1]
y = a[0]
print(x+y)

Solution (Python):
A = list(map(int, input().split()))
A.sort(reverse=True)
print(A[0] * 10 + A[1] + A[2])

Solution (Python):
X = list(map(int, input().split()))
S = sorted(X, reverse=True)
X, Y = S[0] * 10 + S[1], S[2]
print(X + Y)

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()

def resolve():
    l=list(input().split())
    l.sort(reverse=True)
    print(int(l[0]+l[1])+int(l[2]))
resolve()

Solution (Python):
A, B, C = map(int, input().split())
num1 = A*10 + B + C
num2 = A + B*10 + C
num3 = A + B + C*10
print(max(num1, num2, num3))

Solution (Python):
a = [int(i) for i in input().split()]
a.sort()
print(a[0] + a[1] + a[2] * 10)

Solution (Python):
A, B, C = sorted(list(map(int,input().split())))
print(10*C+B+A)

Solution (Python):
temp_list = sorted([int(x) for x in input().split()], reverse=True)
print(temp_list[0] * 10 + temp_list[1] + temp_list[2])

Solution (Python):
A,B,C = map(int, input().split())
max_n = max(A,B,C)
print(max_n*9+A+B+C)

Solution (Python):
s = sorted(list(map(int,input().split())),reverse = True)
print(s[0]*10 + s[1]+s[2])

Solution (Python):
a, b, c = sorted(map(int,input().split()))
print(c*10+b+a)

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

A = lr()
A.sort()
answer = sum(A) + 9 * max(A)
print(answer)

Solution (Python):
a,b,c=map(int,input().split())
max=max(a,b,c)
min=min(a,b,c)
mid=a+b+c-max-min
print(min+mid+(max*10))

Solution (Python):
a,b,c = sorted(map(int,input().split()))

print(c*10 + b + a)

Solution (Python):

A, B, C = sorted(map(int, input().split()))
print(10*C + B + A)

Solution (Python):
A, B, C = list(input().split())
print(max(int(A)+int(B+C),int(A+B)+int(C),int(A)+int(C+B),int(A+C)+int(B),int(B)+int(A+C),int(B+A)+int(C),int(B)+int(C+A),int(B+C)+int(A),int(C)+int(A+B),int(C+A)+int(B),int(C)+int(B+A),int(C+B)+int(A)))

Solution (Python):
A, B, C = sorted(map(int, input().split()), reverse=True)
print(10*A + B + C)

Solution (Python):
d = list(input().split())
l= sorted(d, reverse=True)
print(int(l[0]+l[1]) + int(l[2]))

Solution (Python):
A = list(map(int, input().split()))
A = sorted(A)
ans = A[0] + A[1] + 10 * A[2]
print(ans)

Solution (Python):
def LI(): return list(map(int, input().split()))


A,B,C = LI()
max_value = max([A*10+B+C,A+B*10+C,A+B+C*10])

print(max_value)

Solution (Python):
def LI(): return list(map(str, input().split()))


A = LI()

A.sort(reverse=True)
print(int(A[0] +A[1]) +int(A[2]))

Solution (Python):
a, b, c = map(int, input().split())
print(max(a, b, c) * 9 + a + b + c)

Solution (Python):
a, b, c = map(int, input().split())
ans = []
ans.append(10* a + b + c)
ans.append(10* a + c + b)
ans.append(10* b+ a + c)
ans.append(10* b + c + a)
ans.append(10* c + a + b)
ans.append(10* c + b + a)
print(max(ans))

Solution (Python):
a=sorted([int(i) for i in input().split()])
print(a[0]+a[1]+a[2]*10)