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: 5, 6, ['W', '4759', '7861', '321', '5573', 'O', 'N', '157']

A: 5573
****
Q: 2, 9, ['7111', '835', 'W', '6975', '4459', 'B', 'B', 'Z', 'o']

A: 12269
****
Q: 2, 11, ['f', '5805', '5629', '487', 'q', 'o', 'u', 's', 'i', 'Z', 'h']

A:
11921
****