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]: 14, 18, ['y', '4021', '9011', '3447', '6467', '5599', 'T', 'g', '1441', 'e', '2857', '7251', 'D', '619', '6413', '3145', '9355', 'O', 'Z', '6521', '5005', 'Q']
[EX A]: 19532

[EX Q]: 4, 4, ['t', 'Z', '8689', 'I', '5589', 'H', 'Z']
[EX A]: 0

[EX Q]: 3, 9, ['R', 'D', 'l', 'J', 'U', '4849', 'n', '7659', 'n']
[EX A]:
12508