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, 12, ['1699', '6521', '1705', '8871', 'C', '8963', '8657', 'E', '2693', 'e', 'S', 'a', 'M', '289', '6037', '2663', 'w', 'e', 'X', '2973', 'j', 'f', '1609', '2759', 'P', 'l', 'k', '4463']
[EX A]: 20313

[EX Q]: 1, 2, ['j', '3613']
[EX A]: 3613

[EX Q]: 12, 28, ['w', '4711', '9235', '5477', 'E', 'p', '4455', 'y', 'c', 'Q', '1315', 'm', '5345', '3179', 'O', 'a', '2295', 'I', 'z', '7213', '8287', '4581', 'K', 'W', 'x', 'X', '7307', '9463', '65']
[EX A]:
47670