There is a two digit number. This number is divisible by 6 and 9, and when divided by 7, the remainder is 1. Find this two digit number.
10 100 1 [OP_LIST_ARANGE] 6 9 [OP_LCM] 0 [OP_LIST_DIVIDE_AND_REMAIN] 7 1 [OP_LIST_DIVIDE_AND_REMAIN] 1 [OP_LIST_GET]
var_a = 10
var_b = 100
var_c = 1
list_a = [i for i in range(var_a, var_b + 1, var_c)]
var_d = 6
var_e = 9
var_f = var_e * var_d / math.gcd(int(var_e), int(var_d))
var_g = 0
list_b = [] 
var_f = int(var_f)
var_g = int(var_g)
if var_g < 0:
    var_g = var_g + var_f
for i in list_a:
    i = int(i)
    if i%var_f == var_g:
        list_b.append(i)
var_h = 7
var_i = 1
list_c = [] 
var_h = int(var_h)
var_i = int(var_i)
if var_i < 0:
    var_i = var_i + var_h
for i in list_b:
    i = int(i)
    if i%var_h == var_i:
        list_c.append(i)
var_j = 1
var_k = list_c[var_j-1]
print(int(var_k))