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]: 1, 7, ['173', '5875', 'C', '7417', '3565', '1949', '537', '7707', 'o', 'y']
[EX A]: 19516

[EX Q]: 6, 6, ['I', '8721', '6901', '737', '5767', '9771', 'h']
[EX A]: 9771

[EX Q]: 7, 7, ['8481', '3337', 'd', 'v', 'x', 'U', '9387', '1969', '1705', '8625', 'R', 'S', '4797', 'r', '5757', '8739', '8945', 'p', '8263', '5263', '9651', 'H', 'M', '2789', '3665', 'r', '8993', '343', 's', 'o']
[EX A]:
9387