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]: 2, 9, ['3707', 'J', 'H', '8907', '597', 'Z', '9725', 'g', 'R']
[A]: 19229


[Q]: 1, 15, ['k', 'z', 'D', '4827', '8921', 'o', 'e', 'U', 'f', '7419', 't', 'Z', 'c', '4089', '1117', '2309', '9095']
[A]: 26373


[Q]: 15, 18, ['X', 'U', 'I', 'l', '9503', 'd', 'U', '2603', 'C', 'X', 'D', '9327', 'J', 'g', 'K', '9047', 'D', 'x', '6439', '6323', 'H']
[A]:
9047