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.

Q: 6, 27, ['O', '4985', '525', 'U', 'B', '4689', 'u', '2891', 'A', 'O', 'u', 'T', 'Z', '81', '9747', 'O', '2135', 'U', '8637', '3927', 'X', 'z', 'W', 'h', '6347', 'L', 'c', 'H', 'q']

A: 38454
****
Q: 3, 22, ['k', '427', 'x', '9695', 'a', '2243', '329', 'F', 'n', '6253', '4873', 'f', 'z', 'R', 'b', '4351', 'b', 'i', 'g', '6937', 'I', 'k', 'f']

A: 34681
****
Q: 10, 15, ['V', 'V', '8829', '2183', 'q', '6267', 'R', '487', 'm', 'J', 'I', 'K', '2311', '263', 'X', '9197', 'E', 'x', 'w', 'Z', '6703']

A:
2574
****