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]: 2, 6, ['S', 'y', '2729', '9935', 'T', 'H', '3063', '9587']
[EX A]: 12664

[EX Q]: 9, 21, ['Z', 'Z', '853', '8745', 'L', '4401', 'a', 'L', '8237', 'h', '9163', '1891', '5049', '7075', '1437', '7377', 'E', 't', '837', 'B', 'z', '5629', 'm', 'z', '365', 'M', '8877', '27']
[EX A]: 41066

[EX Q]: 1, 12, ['9797', 'y', 'a', '6427', 'd', '5781', '5511', '8361', 'r', 'B', 'A', 'A', '6349', '9993']
[EX A]:
35877