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: 10, 16, ['Q', '931', 'P', '6777', 'X', '3855', 'i', '1055', 'd', 'p', '7947', 'z', 'X', 'h', 'g', 'w', 'r', 'T']

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

A: 30904
****
Q: 10, 10, ['i', '6329', 'f', '9023', 'W', '8063', '8721', '581', 'Z', 'h', '8873']

A:
0
****