In this task, you are given inputs i,j, and A, where i and j are integers and A is a list. You need to return the sum of all the numerical elements in the list A between the positions i and j (including positions i and j). Return 0 if no numerical element is present in the list between the given ranges. i and j will be non-negative, and will always have a value less than the length of A. i will always be less than j.
--------
Question: 13, 14, ['7395', '8249', 'n', '935', 'q', 'P', '7179', '2683', '8163', '4747', '2501', 'z', '7601', '7115', 'y', '53']

Answer: 14716


Question: 13, 14, ['6693', 'J', '2765', 'P', 'h', '755', 'z', '7483', 'W', '6895', '1293', '3479', 'Y', '1667', '9635']

Answer: 1667


Question: 7, 13, ['7381', '9617', 'Q', 'S', 'i', 'C', '3085', 'k', '7393', 'c', 'l', 'Q', 'F', '1651', '1479', '2367', '9859', '5819', 'g', '5691', 'H', '5165', 'X', '3529', 'a', 'J']

Answer:
10478