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, 14, ['99', 'F', '1297', '7085', 'u', 'w', 'w', '3803', 'F', 'D', 'F', 'L', '5967', '3545', 'E']
[EX A]: 20400

[EX Q]: 5, 6, ['M', '4965', '7693', 'g', 'G', '695', '2401', '5715', 'P', '8197']
[EX A]: 695

[EX Q]: 9, 17, ['K', 'x', 'o', 'I', '5953', 'U', 'l', '4747', '6371', '1109', 'M', 'q', 'X', '9589', '5729', 'g', 'z', '5945', 'H', 'B', 'g', 'x', '477', 'c', 'L']
[EX A]:
22798