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, 15, ['5049', '2581', '4617', 'b', 'c', 'z', '8247', 'd', '1413', '7797', 'K', 'T', '9009', 'V', '5179', '1643', '3923', '4885', 'j', '6717', 'D', 'D', 'O', '5777', 'W', 'J', '6267', 'e']

A: 31645
****
Q: 3, 4, ['4845', '7313', 'P', 'A', '2285', 'C', 't']

A: 0
****
Q: 5, 6, ['F', 'D', '2889', '6639', '4595', 'm', 'P', 'Y', 'U']

A:
4595
****