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):
ai = lambda: list(map(int,input().split()))
ai_ = lambda: [int(x)-1 for x in input().split()]

a,b,c = ai()
d = max(a,b,c)
print(10*d+a+b+c-d)

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

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

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

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= list(map(int,input().split()))

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

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

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

answer = A[0]*10 + A[1] + A[2] 

print(answer)

Solution (Python):
import sys

def input2():
    return tuple(int(x) for x in input().split(" "))

def main(n):
    n.sort(reverse=True)
    print(n[0] * 10 + n[1] + n[2])

if __name__ == "__main__":
    main(list(input2()))

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

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

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

m = 0
for i in range(3):
    tmp = a[i] * 10 + sum(a) - a[i]
    if m < tmp:
        m = tmp
        
print(m)

Solution (Python):
abc = list(map(int, input().split(' ')))
maxV = max(abc)
abc.remove(maxV)

print(maxV * 10 + abc[0] + abc[1])

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

d = [a, b, c]
d.sort()

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

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

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

Solution (Python):
N = sorted(input().split())
print(int(N[2] + N[1]) + int(N[0]))

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

Solution (Python):


def main():
    arry = list(map(int, input().split()))
    arry.sort(reverse=True)
    print(10 * arry[0] + arry[1] + arry[2]) 
    


if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = sorted([int(i) for i in input().split()])

print(10*c+b+a)

Solution (Python):
import numpy as np

a = list(map(int,input().split()))
print(np.max(a) * 9 + np.sum(a))

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

M = max(A,B,C)

print(A+B+C+9*M)

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

z=sorted(list(a))
print(z[2]*10+z[1]+z[0])

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

x.sort()
x.reverse()

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

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

ans = a[2]*10 + a[1] + a[0]

print(ans)

Solution (Python):

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

a.sort()

b = a[-1]*10 + a[-2]
c = a[0]

print(b+c)

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

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

Solution (Python):
a = list(input().split())
a.sort()

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

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

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

    n = sorted([A, B, C])
    ans = n[0] + n[1] + n[2] * 10
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
import numpy as np

num = np.array(list(map(int, input().split())))

num[np.argmax(num)] *= 10

print(np.sum(num))

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

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

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

num.sort()
num.reverse()

kozukai = num[0] * 10 + num[1] + num[2]

print(kozukai)

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

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

Solution (Python):
a,b,c=map(int,raw_input().split(' '))
arr = [a+int(str(b)+str(c)),a+int(str(c)+str(b)),b+int(str(c)+str(a)),b+int(str(a)+str(c)),c+int(str(a)+str(b)),c+int(str(b)+str(a))]
print max(arr)

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

ans1 = a * 10 + b + c
ans2 = b * 10 + c + a
ans3 = c * 10 + a + b

print(max([ans1,ans2,ans3]))

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

ans = 10 * max(ABC) + sum(ABC) - max(ABC)

print(ans)

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

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

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

print(ans)

Solution (Python):
A,B,C = map(int,input().split())
abc =[A,B,C]
res = str(max(abc))
abc.remove(max(abc))
res = res + str(max(abc))
res = int(res) + min(abc)
print(res)

Solution (Python):
def main():
    data = list(map(int, input().split()))
    max_num = max(data)
    data.remove(max_num)
    print(max_num * 10 + sum(data))


if __name__ == "__main__":
    main()

Solution (Python):
from sys import stdin

input = lambda: stdin.readline()

def main():
    ABC = list(input().split())

    ABC.sort(reverse=1)
    ans = int(ABC[0] + ABC[1]) + int(ABC[2])
    print(ans)

main()

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

Solution (Python):
a = list(map(int, input().split()))
d = max(a)

a.remove(d)
d = str(d)
a = list(map(str, a))
print(eval(d + a[0] + "+" + a[1]))

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

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

nums.sort()

a = nums[2] * 10 + nums[1]
b = nums[0]

print(a + b)

Solution (Python):
def main():
    s = [item for item in input().split()]
    s.sort(reverse=True)
    print(int(s[0]+s[1])+int(s[2]))

if __name__ == '__main__':
    main()

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

one.sort()
print(10*one[2]+one[1]+one[0])

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())
print(max(a,b,c)*10+sum((a,b,c))-max(a,b,c))

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

ans=0
for i in range(3):
	if i==0: ans+=A[i]*10
	else:    ans+=A[i]

print ans

Solution (Python):

import math,string,itertools,fractions,heapq,collections,re,array,bisect

def s():
    return input()
def n():
    return int(input())
def d():
    return float(input())

def ls():
    return input().split()
def ln():
    return map(int, input().split())
def ld():
    return map(float, input().split())

def fs():
    return [input() for i in range(input())]
def fn():
    return [int(input()) for i in range(input())]
def fd():
    return [float(input()) for i in range(input())]

ABC = list(ln())
ABC = sorted(ABC)
ans1 = ABC[2]*10 + ABC[1] + ABC[0]
ans2 = ABC[2]*10 + ABC[0] + ABC[1]
print(max(ans1,ans2))

Solution (Python):
i = sorted(list(map(int, input().split())), reverse=True)

print(int("{}{}".format(str(i[0]), str(i[1]))) + i[2])

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

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

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

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

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

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

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

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

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

ma=max(li)
li.remove(ma)

ans=ma*10

for i in li:
    ans+=i

print(ans)

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

if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin

A = [int(i) for i in stdin.readline().rstrip().split()]
A.sort()

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

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

Solution (Python):
abcs = list(map(int, input().split()))
max_int = max(abcs)
abcs.remove(max(abcs))
print(max_int * 10 + abcs[0] + abcs[1])

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

Solution (Python):


import math
import sys
import itertools
import numpy as np


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())
n = sorted([a, b, c])
print(n[2] * 10 + n[1] + n[0])

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

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

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

Solution (Python):
x = input().split() 
a = int(x[0])
b = int(x[1])
c = int(x[2])
print(max(10*a + b + c,a + 10 * b + c,a + b + 10 * c))

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

sol = []
sol.append(a*10+b+c)
sol.append(b*10+a+c)
sol.append(c*10+a+b)

print(max(sol))

Solution (Python):
import sys
stdin = sys.stdin

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x)-1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

a,b,c = li()
abc = list([a,b,c])

abc.sort(reverse=True)

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

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

Solution (Python):
a, b, c = [int(v) for v in input().split()]

v = sorted([a, b, c], reverse=True)
print(int(str(v[0]) + str(v[1])) + v[2])

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

solve()

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

Solution (Python):


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


if __name__ == '__main__':
    main()

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

Solution (Python):


a, b, c = map(int, input().split())
print(max(int(str(a)+str(b))+c, int(str(b)+str(a))+c, int(str(b)+str(c))+a, int(str(c)+str(b))+a, int(str(c)+str(a))+b, int(str(a)+str(c))+b))

Solution (Python):
def ketanowa(p):
    ans = 0
    p = str(p)
    for i in p:
        ans += int(i)
    return ans


def main():
    temp=input()
    temp=list(map(int,list(temp.split(" ")))) 
    temp = sorted(temp,key = lambda x:-x)
    print(temp[0]*10+temp[1]+temp[2])

if __name__ == '__main__':
    main()

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

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

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

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

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

Solution (Python):
a, b, c = map(int, input().split(" "))
ret=0
if a>=b and a>=c:
    ret = 10 * a + (b+c)
elif b>=a and b>=c:
    ret = 10 * b + (a+c)
else:
    ret = 10 * c + (a+b)

print (ret)

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

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

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

a.sort()

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

Solution (Python):
def run(a, b, c):
    s = sorted([a, b, c])
    return 10*s[2]+s[1]+s[0]


def main():
    a, b, c = map(int, input().split())
    print(run(a, b, c))


if __name__ == '__main__':
    main()

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

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

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

k = max(a)

print(k*9+sum(a))

Solution (Python):

cards = sorted(map(int, raw_input().split(' ')))

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

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

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

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

a.sort()

ans = a[2]*10 + a[1] + a[0]

print(ans)

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

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

Solution (Python):

a=list(map(int,input().split()))
a.sort()
[A,B,C] = a

ans = int(str(C)+str(B)) + A
print(ans)

Solution (Python):
nums = [int(num) for num in input().split()]
a = nums[0]
b = nums[1]
c = nums[2]
maxi = max(a,b)
maxi = max(maxi,c)
if maxi == a:
    ans = a*10 +b+c
elif maxi == b:
    ans = b*10+a+c
else:
    ans = c*10+a+b    
print(ans)

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

L = [A, B, C]

L.sort()

ans =  L[2] * 10 + L[1] + L[0]

print(ans)

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

Solution (Python):

a = map(int,input().split(" "))

a = sorted(a)

print(sum(a)+max(a)*9)

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

A = sorted(A)

big = A[2]
mid = A[1]
sma = A[0]

print(big * 10 + mid + sma)

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

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

Solution (Python):
def i1():
 return int(input())
def i2():
 return [int(i) for i in input().split()]

x=i2()
x.sort()
print(x[0]+x[1]+x[2]*10)

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

Solution (Python):


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

Solution (Python):

from itertools import takewhile
def solve():
    a,b,c = list(map(int, input().split()))
    res = a+b+c+9*max([a,b,c])
    return str(res)

if __name__ == '__main__':
    print(solve())

Solution (Python):
a = input().split()

a = [int(i) for i in a]
a = sorted(a)

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

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

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

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

Solution (Python):
listA = list(map(int, input().split()))
listA.sort()
a = listA[2]
b = listA[1]
c = listA[0]

print(a*10+b+c)

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

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

maxNum = max(a, b, c)

print(a + b + c - maxNum + maxNum * 10)

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

print(10*m+l+n)

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

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

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

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

Solution (Python):
a, b, c = [int(i) for i in input().split()]

n = [a, b, c]
n = sorted(n)

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

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

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

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

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

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

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

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

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

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

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

a.sort()

a.reverse()

b = int(a[0])*10 + int(a[1])

c = int(a[2])

print(b+c)

Solution (Python):
A = [0, 0, 0]
A[0], A[1], A[2] = map(int, input().split())
A.sort()

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

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

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

print(sum(a)+9*max(a))

Solution (Python):

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
def getN():
    return int(input())

def getMN():
    a = input().split()
    b = [int(i) for i in a]
    return b[0],b[1]

def getlist():
    a = input().split()
    b = [int(i) for i in a]
    return b

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

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

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())
d = [a,b,c]
d.sort()
print(d[2]*10+d[1]+d[0])

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

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

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

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

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

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

Solution (Python):


INF = float('inf')


def inpl(): return list(map(int, input().split()))


X = inpl()
X.sort()
print(X[2] * 10 + X[1] + X[0])

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

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

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


arr = nl()
print(max(arr) * 9 + sum(arr))

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

Solution (Python):
import numpy as np
import math





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

largest = max([A, B, C])
total = largest * 9 + A + B + C
print(total)

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

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

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

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

print(c * 10 + a + b)

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

Solution (Python):

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

Solution (Python):
from sys import stdin
a = map(int,stdin.readline().split())
a.sort()
a.reverse()
print a[0] * 10 + a[1] + a[2]

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

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

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

abc.sort()
print(abc[2] * 10 + abc[1] + abc[0])

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

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

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

Solution (Python):
from itertools import permutations

A, B, C = raw_input().split()
ans = 0

for p in permutations([A, B, C, '+']):
    if p[0] == '+' or p[3] == '+':
        continue
    ans = max(ans, eval(''.join(p)))
print ans

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

print(max(val) * 9 + sum(val))

Solution (Python):
I = [int(i) for i in input().split()]
I.sort(reverse=True)
a, b, c = map(str, I)
ans = int(a + b) + int(c)
print(ans)

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,10*b+a+c,10*c+a+b))

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

Solution (Python):
A,B,C = map(int,input().split())
X = [A,B,C]
X.sort(reverse=True)

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

Solution (Python):
xs = [int(_) for _ in input().split()]

xs.sort()

result = xs[2] * 10 + xs[1] + xs[0]

print(result)

Solution (Python):
a,b,c = sorted(input().split(),reverse=True)
print(eval(a+b+'+'+c))

Solution (Python):


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

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

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

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

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(1000000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


def gcd(n, m):
    if n % m == 0:
        return m
    else:
        return gcd(m, n % m)


def gcd_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = gcd(v, L[i])

    return v


def lcm(n, m):
    return (n * m) // gcd(n, m)


def lcm_list(L):
    v = L[0]

    for i in range(1, len(L)):
        v = lcm(v, L[i])

    return v



def wfs_d(D, N, K):
    """
    D: 隣接行列(距離付き)
    N: ノード数
    K: 始点ノード
    """

    dfk = [-1] * (N + 1)
    dfk[K] = 0

    cps = [(K, 0)]
    r = [False] * (N + 1)
    r[K] = True
    while len(cps) != 0:
        n_cps = []
        for cp, cd in cps:
            for i, dfcp in enumerate(D[cp]):
                if dfcp != -1 and not r[i]:
                    dfk[i] = cd + dfcp
                    n_cps.append((i, cd + dfcp))
                    r[i] = True

        cps = n_cps[:]

    return dfk



def dfs_d(v, pre, dist):
    """
    v:  現在のノード
    pre: １つ前のノード
    dist: 現在の距離

    以下は別途用意する
    D: 隣接リスト(行列ではない)
    D_dfs_d: dfs_d関数で用いる，始点ノードから見た距離リスト
    """

    global D
    global D_dfs_d

    D_dfs_d[v] = dist

    for next_v, d in D[v]:
        if next_v != pre:
            dfs_d(next_v, v, dist + d)

    return


def sigma(N):
    ans = 0
    for i in range(1, N + 1):
        ans += i
    return ans


def comb(n, r):
    if n - r < r: r = n - r
    if r == 0: return 1
    if r == 1: return n

    numerator = [n - r + k + 1 for k in range(r)]
    denominator = [k + 1 for k in range(r)]

    for p in range(2, r + 1):
        pivot = denominator[p - 1]
        if pivot > 1:
            offset = (n - r) % p
            for k in range(p - 1, r, p):
                numerator[k - offset] /= pivot
                denominator[k] /= pivot

    result = 1
    for k in range(r):
        if numerator[k] > 1:
            result *= int(numerator[k])

    return result

def bisearch(L, target):
    low = 0
    high = len(L) - 1
    
    while low <= high:
        mid = (low + high) // 2
        guess = L[mid]
        if guess == target:
            return True
        elif guess < target:
            low = mid + 1
        elif guess > target:
            high = mid - 1
    if guess != target:
        return False



dp = None


def main():
    a = input().split()
    a.sort(reverse=True)

    print(int(a[0] + a[1]) + int(a[2]))


main()

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

Solution (Python):
il = lambda: list(map(int, input().split()))
ils = lambda n, s="int(input())": [eval(s) for _ in range(n)]

a = il()
a.sort()
print(a[2] * 10 + a[1] + a[0])