A number that is a multiple of 7, when divided by 2, 3, 4, 5, or 6, has a remainder of 1. Find the third smallest of these numbers.
0 9999 1 [OP_LIST_ARANGE] 2 1 [OP_LIST_DIVIDE_AND_REMAIN] 3 1 [OP_LIST_DIVIDE_AND_REMAIN] 4 1 [OP_LIST_DIVIDE_AND_REMAIN] 5 1 [OP_LIST_DIVIDE_AND_REMAIN] 6 1 [OP_LIST_DIVIDE_AND_REMAIN] 7 [OP_LIST_DIVISIBLE] 3 [OP_LIST_MIN]
var_a = 0
var_b = 9999
var_c = 1
list_a = [i for i in range(var_a, var_b + 1, var_c)]
var_d = 2
var_e = 1
list_b = [] 
var_d = int(var_d)
var_e = int(var_e)
if var_e < 0:
    var_e = var_e + var_d
for i in list_a:
    i = int(i)
    if i%var_d == var_e:
        list_b.append(i)
var_f = 3
var_g = 1
list_c = [] 
var_f = int(var_f)
var_g = int(var_g)
if var_g < 0:
    var_g = var_g + var_f
for i in list_b:
    i = int(i)
    if i%var_f == var_g:
        list_c.append(i)
var_h = 4
var_i = 1
list_d = [] 
var_h = int(var_h)
var_i = int(var_i)
if var_i < 0:
    var_i = var_i + var_h
for i in list_c:
    i = int(i)
    if i%var_h == var_i:
        list_d.append(i)
var_j = 5
var_k = 1
list_e = [] 
var_j = int(var_j)
var_k = int(var_k)
if var_k < 0:
    var_k = var_k + var_j
for i in list_d:
    i = int(i)
    if i%var_j == var_k:
        list_e.append(i)
var_l = 6
var_m = 1
list_f = [] 
var_l = int(var_l)
var_m = int(var_m)
if var_m < 0:
    var_m = var_m + var_l
for i in list_e:
    i = int(i)
    if i%var_l == var_m:
        list_f.append(i)
var_n = 7
list_g = []
var_n = int(var_n)
for i in list_f:
    i = int(i)
    if i % var_n == 0:
        list_g.append(i)
var_o = 3
list_h=list_g.copy()
list_h.sort()
var_p = list_h[var_o-1]
print(int(var_p))