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, 10, ['3907', '1629', 'v', '6711', '8347', 'E', '4067', 'T', '1665', '5735', '4879']
[EX A]: 19814

[EX Q]: 2, 8, ['r', 'H', 'K', 'K', '7307', 'i', '9381', '4175']
[EX A]: 20863

[EX Q]: 1, 1, ['347', 'l', '9893']
[EX A]:
347