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: 2, 5, ['m', 'o', 't', 'c', 'S', 'R', 'I', '4937', '1127', '1611', '285', '3653', '309', 'y', '513', 'i', '8005', 'n', '6915', '8585', 'G', 'A', '1921', 'd']

A: 0
****
Q: 11, 15, ['C', 'E', '9009', '9169', 'k', 'z', 'O', 'X', 'q', '2333', 's', 'H', '1145', 'a', '3773', '4701', '955', 'c', 'U', '3643', 'j', 'u', '5153', 'w', '721', 'S', 'I']

A: 4918
****
Q: 1, 8, ['9385', '6915', 'D', '1767', 'l', '6929', '2971', '3695', '4423']

A:
31662
****