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: 7, 12, ['3713', 'N', '7191', '73', '4595', '6537', 'H', 'v', 'H', '8531', 'k', 'H', 's', 'x', 'R', 'd', '507', 'C', '9649', '8875', '7931']

A: 8531
****
Q: 2, 8, ['4517', 'w', '9145', '5477', '7679', 'j', '8603', 'z']

A: 30904
****
Q: 13, 17, ['Q', '5289', 'c', '4899', '6689', '4415', '6359', '9115', 'g', 'G', '4839', '7981', '1731', 'S', 'C', 'w', '9743', '3391', 'w']

A:
11474
****