What is the largest possible sum that can be calculated in an addition expression comprised of two-digit numbers that were made using 1, 7, 9, and 2 once? 
[OP_LIST_SOL] 1 7 9 2 [OP_LIST_EOL] 1 [OP_LIST_MAX] 10 [OP_MUL] 1 [OP_LIST_MIN] [OP_ADD] 2 [OP_LIST_MAX] 10 [OP_MUL] 2 [OP_LIST_MIN] [OP_ADD] [OP_ADD]
var_a = 1
var_b = 7
var_c = 9
var_d = 2
list_a= []
if "/" in str(var_d):
    var_d = eval(str(var_d))
list_a.append(var_d)
if "/" in str(var_c):
    var_c = eval(str(var_c))
list_a.append(var_c)
if "/" in str(var_b):
    var_b = eval(str(var_b))
list_a.append(var_b)
if "/" in str(var_a):
    var_a = eval(str(var_a))
list_a.append(var_a)
list_a.reverse()
var_e = 1
list_b=list_a.copy()
list_b.sort()
var_f = list_b[-var_e]
var_g = 10
var_h = var_f * var_g
var_i = 1
list_c=list_a.copy()
list_c.sort()
var_j = list_c[var_i-1]
var_k = var_h + var_j
var_l = 2
list_d=list_a.copy()
list_d.sort()
var_m = list_d[-var_l]
var_n = 10
var_o = var_m * var_n
var_p = 2
list_e=list_a.copy()
list_e.sort()
var_q = list_e[var_p-1]
var_r = var_o + var_q
var_s = var_k + var_r
print(int(var_s))