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):
a,b,c=sorted(input().split());print(eval(c+b+"+"+a))

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

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

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

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

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

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

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

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

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):
ABC=[x for x in input().rstrip().split()]
ABC.sort(reverse=True)
ab=ABC[0]+ABC[1]
c=ABC[2]
print(int(ab)+int(c))

Solution (Python):

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

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

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

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

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

Solution (Python):

l = sorted(list(input().split()))
print(int(l[2] + l[1]) + int(l[0]))

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

Solution (Python):
A=''.join(sorted(input().split())[::-1])
print(eval(A[:2]+'+'+A[2]))

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

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

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

Solution (Python):

from itertools import permutations
import sys


def solve(A: int, B: int, C: int):
    m = 0
    for n1, n2, n3 in permutations([A, B, C]):
        exp1 = "%d+%d%d" % (n1, n2, n3)
        exp2 = "%d%d+%d" % (n1, n2, n3)
        m = max(m, eval(exp1), eval(exp2))
    print(m)


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    C = int(next(tokens))  
    solve(A, B, C)


if __name__ == '__main__':
    main()

Solution (Python):
a, b, c = (input().split())
game = [a,b,c]
s_game = sorted(game , reverse =True)

ans1 = s_game[0]+ s_game[1]

ans = int(ans1) + int(s_game[2])
print(ans)

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

l=[a,b,c]

l.sort()

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

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

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

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

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

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

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

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

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

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

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

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

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

print(int(C+B)+int(A))

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

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

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

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

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

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):
A = list(map(int, input().split()))
a = sorted(A)
k = str(a[-1])+str(a[1])
print(int(k)+a[0])

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

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=map(int,input().split())
print(max(a*10+b+c,a+b*10+c,a+b+c*10))

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

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

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

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

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

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

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

a = sorted(a, reverse=True)

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

Solution (Python):
MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)

def main():
    a = list(map(int,input().split()))
    a.sort()
    ans = a[0] + a[1] + a[2] * 10
    print(ans)
if __name__ == '__main__':
    main()

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

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

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

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

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

x = A * 10 + B + C
y = A + 10 * B + C
z = A + B + 10 * C
print(max(x, y, z))

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

A, B, C = MAP()
print(max(10*A + B + C, 10*B + A + C, 10*C + A + B))

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

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

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

l = [A, B, C]

num = str(l.pop(l.index(max(l)))) + str(l.pop(l.index(max(l))))

print(int(num) + max(l))

Solution (Python):
def main():
    A, B, C = map(int, input().split())
    number = sorted([A, B, C], reverse = True)
    print(int(10*number[0] + number[1] + number[2]))
if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

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

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

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

if __name__ == '__main__':
    main()

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

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

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

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

elif max < int(c+a) + int(b):
    max = int(c+a) + int(b)
print(max)

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

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

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

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

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

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

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

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

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

Solution (Python):
s = input().rstrip().split(' ')
s.sort(reverse=True)
money = (10*int(s[0])+int(s[1])) + int(s[2])
print(money)

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

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

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

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

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

Solution (Python):
import sys

abc = list(map(int, sys.stdin.readline().rstrip().split()))
abc.sort(reverse=True)
print(int(str(abc[0])+str(abc[1])) + abc[2])

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

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

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

ans = sum([A,B,C])+max([A,B,C])*9
print(ans)

Solution (Python):
import sys

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


if __name__ == '__main__':
    lines = []
    for l in sys.stdin:
        lines.append(l.rstrip('\r\n'))
    main(lines)

Solution (Python):



A, B, C = [int(i) for i in input().split()]

desc = sorted([A,B,C], reverse=True)
print(desc[0]*10 + desc[1]+desc[2])

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

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

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

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

if a >= b and a >= c:
    print(a*10+b+c)
elif b >= a and b >= c:
    print(b*10+a+c)
else: print(c*10+a+b)

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

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

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

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

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())

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

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

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

a.sort()
ans = int(str(a[2]) + str(a[1])) + a[0] 
print(ans)

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

Solution (Python):
li = list(map(str, input().split()))*2
ans = 0
for i in range(3):
    ans = max(ans, int(li[i]+li[i+1]) + int(li[i+2]))
print(ans)

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

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

Solution (Python):
from itertools import permutations


def main():
    a,b,c = input().split()
    lst = ["+",a,b,c]
    perm = list(permutations(lst))
    mx = 0
    for p in perm:
        if p[0] == "+" or p[-1] == "+":
            continue
        mx = max(mx,eval("".join(p)))
    print(mx)



if __name__ == '__main__':
    main()

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

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

Solution (Python):



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


num_list = sorted(num_list, reverse=True)
num_list = list(map(str, num_list))


ans = eval(num_list[0] + num_list[1] + "+" + num_list[2])
print(ans)

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

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

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

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

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

Solution (Python):
import math
import collections
import sys


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

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

Solution (Python):





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

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

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

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=sorted(map(int,input().split()))
print(10*c+b+a)

Solution (Python):
a,b,c = (map(int,input().split()))
L = [a,b,c]
M = L.sort()

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

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

a.sort(reverse = True)
n_a = int(a[0] + a[1])
n_b = int(a[2])
print(n_a+n_b)

Solution (Python):

a = list(map(int,input().split()))
a.sort()

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

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

l.sort()

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

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

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

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

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,B,C=map(int,input().split())
x=max((10*A)+B+C,(10*B)+A+C,(10*C)+A+B)
print(x)

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

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

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

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

Solution (Python):
from itertools import permutations

l = input().split()

res = 0
for i in permutations(l):
    x = int(i[0])
    y = int(''.join(i[1:]))
    ans = x+y
    res=max(res,ans)
print(res)

Solution (Python):

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

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

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

Solution (Python):
def Maximize(abc):

    abc.sort(reverse=True)

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

def main():
    abc = list(map(int , input().split()))
    print(Maximize(abc))

if __name__ == '__main__':
    main()

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

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

if a >= b and a >= c :
    s = str(a)+str(b)
    total = int(s)+c
    print(total)

elif b >= a and b >= c:
    s = str(b)+str(a)
    total = int(s)+c
    print(total) 

elif c >= a and c >= b:
    s = str(c)+str(a)
    total = int(s)+b
    print(total)

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

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

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

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

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

maxNum = max(a,max(b,c))

if maxNum == a:
    sumNumString = str(a) + str(b)
    sumNum = int(sumNumString)
    print(sumNum+c)
elif maxNum == b:
    sumNumString = str(b) + str(a)
    sumNum = int(sumNumString)
    print(sumNum+c)
else:
    sumNumString = str(c) + str(a)
    sumNum = int(sumNumString)
    print(sumNum+b)

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

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

num.sort()

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

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

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

Solution (Python):
l = sorted(input())
print(int(l[4]) * 10 + int(l[3]) + int(l[2]))

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

a.sort()

print(a[-1]*10+a[-2]+a[-3])

Solution (Python):

ABC = sorted(list(map(int, input().split())))
print(int(str(ABC[2])+str(ABC[1])) + ABC[0])

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

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

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

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

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

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())

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

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

num.sort(reverse=True)

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

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

a.sort(reverse=True)



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

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

x = LI()
x.sort(reverse=1)
ans = x[0]*10 + x[1] + x[2]
print(ans)

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

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

Solution (Python):
import sys

input = sys.stdin.readline

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

arr = [A, B, C]
arr.sort()

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

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

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

Solution (Python):
lines = list(input().split())

lines.sort()

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

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
from datetime import datetime as dt

def main():
  a, b, c = map(int, readline().split())
  print(max(a,b,c)*9 +a+b+c)
  
  
  
  
if __name__ == '__main__':
  main()

Solution (Python):

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

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

jun = [a, b, c]
ojun = sorted(jun, reverse = True)

x = 10*ojun[0] + ojun[1]
y = ojun[2]
ans = x + y

print(ans)

Solution (Python):
import itertools
import fractions
def main():
  a,b,c = map(int, input().split())
  ma = a + (b*10 + c)
  ma = max(ma,(a*10+b)+c)
  ma = max(ma,(c*10+a)+b)
  ma = max(ma,(c*10+b)+a)
  ma = max(ma,(a*10+c)+b)
  ma = max(ma,(b*10+a)+c)
  print(ma)
if __name__ == '__main__':
  main()

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

Solution (Python):

List = sorted([i for i in input().split(" ")],reverse=True)

X = int("".join(List[:2]))
Y = int(List[-1])
print(X+Y)

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

li = [A,B,C]
li.sort(reverse = True)
ans1 = li[0]*10+li[1]
ans2 =li[2]
ans = ans1 + ans2
print(ans)

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

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

Solution (Python):
l = list(map(int, input().split()))
m = max(l)
l.remove(m)
print(int(str(m) + str(l[0])) + l[1])

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

Solution (Python):
import sys

*a, = map(int, sys.stdin.readline().split())
a.sort(reverse=True)

def main():
    ans = a[0] * 10 + a[1] + a[2]
    print(ans)

if __name__ ==  '__main__':
    main()

Solution (Python):
*I, = map(int, input().split())
I2 = I.pop(I.index(min(I)))
print(int(str(max(I))+str(min(I))) + I2)

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

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

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    a = [int(i) for i in input().split()]
    a.sort(reverse=True)
    ans =a[0]*10 +a[1] +a[2]
    print(ans)

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

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

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

Solution (Python):


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

lst.sort(reverse=True)

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

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

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

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

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

if A >= B and A >= C :
	answer = A * 10 + B + C
elif B >= C :
	answer = B * 10 + A + C
else:
	answer = C * 10 + A + B

print(answer)

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

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

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

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

Solution (Python):
import sys
from bisect import *
from heapq import *
from collections import *
from itertools import *
from functools import *
from math import *
from fractions import *

sys.setrecursionlimit(100000000)
input = lambda: sys.stdin.readline().rstrip()

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

main()

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

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

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

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

print(max(A,B,C)*10 + min(A,B,C) + (A+B+C)-max(A,B,C)-min(A,B,C))

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

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

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

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

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

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

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

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

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

l.sort(reverse=True)
x = l[0:2]
x = int("".join(x))
print(x+int(l[2]))

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

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

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

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

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

print(x+y)

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

num=str(max(a))+str(sorted(a)[-2])
print(int(num)+min(a))

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

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())
n = max(a,b,c)*9 + a + b + c
print(n)

Solution (Python):
a,b,c = map(int, input().split())
u = max(a,b,c)
v = min(a,b,c)

n1 = u*10 + v
n2 = a + b + c -u - v

print(n1 + n2)

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

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

print(int(str(num[-1]) + str(num[-2])) + num[0])

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

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

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

lis = sorted(lis, reverse=True)

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

Solution (Python):
a,b,c=sorted(input().split())[::-1]
print(int(a+b)+int(c))

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

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

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

Solution (Python):
def main():
    a,b,c = input().split()
    mx = 0
    for i,first in enumerate([a,b,c]): 
        
        second,third = [s for j,s in enumerate([a,b,c]) if j != i]
        if second < third:
            second,third = third,second
        if int(first) + int(second+third) > mx:
            mx = int(first) + int(second + third)
    print(mx)

main()

Solution (Python):
n = list(map(int, input().split()))
n.sort(reverse=True)
n = ''.join(map(str, n))
sushiki = n[:2] + '+' + n[2]
ans = eval(sushiki)
print(ans)

Solution (Python):
a=[int(x) for x in input().split()]
a=sorted(a)
print(sum(a[:-1])+a[-1]*10)

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

Solution (Python):

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

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

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

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