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: 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: 13, 14, ['6693', 'J', '2765', 'P', 'h', '755', 'z', '7483', 'W', '6895', '1293', '3479', 'Y', '1667', '9635']

A: 1667
****
Q: 12, 17, ['1', 'A', '557', 'M', '9017', '8365', '4251', 'v', '5187', '6251', '3231', 'H', 's', '8337', 'O', '2775', 'v', '863', '3825', '77', '6769', 'L', '8257', 'Y', '5979', '6279', 'L', '9563']

A:
11112
****