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: 7, 7, ['S', 'a', '1011', '673', '7777', '8529', 'Y']

A: 0
****
Q: 1, 14, ['J', '4147', 'z', 'M', 'Z', 'd', 'f', 's', '5083', 'L', '7107', 'g', '7047', 'E', '5931', '141', '6889']

A: 23384
****
Q: 10, 20, ['4547', 'u', 'W', 'j', '1673', '6611', '5093', '8351', 'i', 'u', '105', 'W', 'X', '6407', 'C', '1229', '4729', '6907', '8253', '1313', 'F', 'W', '883']

A:
28943
****