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: 6, 10, ['5601', '3783', '7919', '9195', 'G', 'J', 'L', 'X', 'O', 'F', '2479', 's', 'H', '5353', '7079', '2199', '2937', 'S']

A: 0
****
Q: 15, 21, ['w', 'R', '9247', '5745', '5397', 'U', 'R', 'e', '8067', 'e', '2851', 'O', 'F', '4705', '5393', 'q', 'b', 'J', '211', '4319', 'o', 'h', 'Z', '4423', 'j', '2691', 'U']

A: 9923
****
Q: 2, 14, ['6497', 'p', 'n', 'q', 'F', '697', 'w', 'N', '9289', 'd', 'E', 'E', '6955', '4075', 'f', 'O', 'B']

A:
21016
****