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.

[EX Q]: 4, 9, ['9557', '1661', 'E', '5173', 'o', '4963', '2811', '5471', '3853']
[EX A]: 22271

[EX Q]: 1, 7, ['J', 'l', '9145', '5805', '4377', '2851', '8781', '7353', '145']
[EX A]: 30959

[EX Q]: 14, 18, ['B', 'L', '6995', '345', '9207', '5961', '8941', '135', 'd', 'Q', '93', '2137', '4677', 'v', '217', '4215', '1651', '8389']
[EX A]:
14472