When you divide a particular number by 2, 3, 4, 5, and 6, you get a remainder of 1, and that particular number is divisible by 7. When these numbers are counted from the smallest number, what number will come in the 3rd place?
0 9999 1 [OP_LIST_ARANGE] 2 3 [OP_LCM] 4 [OP_LCM] 5 [OP_LCM] 6 [OP_LCM] 1 [OP_LIST_DIVIDE_AND_REMAIN] 7 0 [OP_LIST_DIVIDE_AND_REMAIN] 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 = 3
var_f = var_e * var_d / math.gcd(int(var_e), int(var_d))
var_g = 4
var_h = var_g * var_f / math.gcd(int(var_g), int(var_f))
var_i = 5
var_j = var_i * var_h / math.gcd(int(var_i), int(var_h))
var_k = 6
var_l = var_k * var_j / math.gcd(int(var_k), int(var_j))
var_m = 1
list_b = [] 
var_l = int(var_l)
var_m = int(var_m)
if var_m < 0:
    var_m = var_m + var_l
for i in list_a:
    i = int(i)
    if i%var_l == var_m:
        list_b.append(i)
var_n = 7
var_o = 0
list_c = [] 
var_n = int(var_n)
var_o = int(var_o)
if var_o < 0:
    var_o = var_o + var_n
for i in list_b:
    i = int(i)
    if i%var_n == var_o:
        list_c.append(i)
var_p = 3
list_d=list_c.copy()
list_d.sort()
var_q = list_d[var_p-1]
print(int(var_q))