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]: 3, 16, ['1661', '2609', '7987', '619', '6765', '5249', '1377', '8971', 'J', 'o', '4803', 'O', '699', '4415', 'V', '1813', 'j', 'm', 'L']
[EX A]: 42698

[EX Q]: 1, 2, ['9621', '3231', '5905', 'M', '3233', 'j', '2449', '3805', '4923', '235', '407', 'w']
[EX A]: 12852

[EX Q]: 7, 11, ['N', '8637', 'J', '9215', '8097', 'W', '9497', 'p', '5201', '8251', 'F', '4485', 'w', 'b', 'n', '9909', 'z', 'h']
[EX A]:
22949