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: 14, 29, ['1447', 'P', 'X', '5411', '4235', 'K', '6749', '171', '9349', 'K', 'n', '3477', '1183', '9933', '6259', '5793', '1719', 'V', 'C', '1983', '9947', 'I', 'c', '4425', 'Q', 'v', 'a', '3783', '9665', 'z']

A: 53507
****
Q: 7, 17, ['n', '1023', '2743', 'r', '5855', 'd', '4425', '3381', 'x', '9609', 'f', 'o', '8513', 'e', '7331', 'N', '7949', 'O']

A: 41208
****
Q: 3, 8, ['z', 'G', 'n', '9513', 'S', '2289', '8571', '6039']

A:
26412
****