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]: 5, 9, ['X', '6543', '1123', '5967', 'x', '9197', '2865', 'r', 'V', 'c']
[EX A]: 12062

[EX Q]: 1, 11, ['5355', 'C', 'U', '7363', 'A', 'F', '2893', 'L', 'q', '8973', '8853', '9297', 'v', 'z', 'u', '1227', 'J', '5333', '2515', '6461']
[EX A]: 33437

[EX Q]: 1, 11, ['J', '9763', '9651', '5369', 'T', '2797', 'S', '4599', '1263', '6879', 'N', 'f', 'p', 'S', '8165', 'A']
[EX A]:
40321