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, 4, ['Y', 'X', 'r', '439', 'D', 'H', '1903']
[EX A]: 439

[EX Q]: 2, 2, ['M', '3453', '5733', '2337', '9975', '1827', 't', '4937']
[EX A]: 3453

[EX Q]: 9, 13, ['j', 'p', '5155', 'f', 'y', 'R', 'p', '5557', 'b', '2715', 'b', '5187', 'I', 'd', 't', 'y', 'L', '4051', '6917', '8487', 'O', '3799', 'O', 'M', 'b', '3335', '2471', '8219', '8823']
[EX A]:
7902