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: 3, 21, ['X', 'Z', '749', '5557', '9991', 'T', '3461', '335', 'I', 'J', '7113', 'b', '2683', '653', '3951', '4193', 'J', '7179', 'G', 'Y', '6151', '2873', 'X', '5619', '5151', '7689', '5605', 'o']

A: 52016
****
Q: 3, 4, ['6203', 'g', '471', 'j', 'o', '9679', 'M', '5459', 'y', '1929', '1649', 'C']

A: 471
****
Q: 20, 22, ['9567', 's', '2825', '6283', 'p', 'V', 'P', 'Q', 'H', 'I', 'J', 'V', '4467', '5789', 'n', '779', '741', 's', 'n', 'G', '2683', '875', '5261', '7127', '311', '6259', '2991', '1673', 'c']

A:
3558
****