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: 4, 12, ['2337', 'A', 'j', 'p', 'c', 'k', 'Y', 'Q', 'N', 'L', '8857', '9985', 'N', 'x', 'u']

A: 18842
****
Q: 4, 12, ['f', '3507', 'T', 's', '9209', 'T', 'o', '769', 'U', 'i', 'V', '5723', '2151', 't', 'Z', '5857', '951', '3261', 'd', '407', 'X', '1869', '1483', '3631', '2949']

A: 15701
****
Q: 12, 20, ['g', '2159', '7405', '3979', '8597', 'k', '6371', 'Z', 'K', '3445', 'u', '3671', '5073', 'l', 'I', 'V', '7797', 'X', '3277', '7581', '3611', '8433', '6107', '5955', 'W']

A:
27399
****