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: 6, 18, ['5051', 'g', 'C', 'p', 'O', 'i', 'E', '4947', '5345', '8453', '4967', '3749', 'F', 'P', '5045', 'o', '5605', 'H', '9319', '5471', 'F', 'B', 't', 'H']

A: 38111
****
Q: 6, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']

A: 13298
****
Q: 11, 20, ['5443', 'Y', 'O', 'S', '3461', 'v', '9047', '4993', '4557', 'X', '5353', 'e', 'r', 'h', '2251', '2701', 'G', '8197', '6265', '4767']

A:
29534
****