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]: 4, 5, ['677', '5585', 'W', 'J', 'C']
[A]: 0


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


[Q]: 6, 11, ['h', '9777', '2177', '749', '285', '6261', 'Q', 'y', 'G', 'F', '9307', '5623', 'G']
[A]:
15568