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]: 6, 6, ['I', '8721', '6901', '737', '5767', '9771', 'h']
[EX A]: 9771

[EX Q]: 2, 9, ['S', 't', '243', '5691', '5695', 'Y', 'd', '8695', 'M', 'K', 'z', 'I', '7325', '8945', 'P', 'Q', 'I', 'N']
[EX A]: 20324

[EX Q]: 8, 18, ['6547', 'c', '6259', '4549', '9431', '5377', '1651', 'x', 'F', '7919', 'C', '7913', 'X', '2777', 'Z', '6655', 'S', 'R']
[EX A]:
25264