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, 5, ['9615', '7859', 'D', 'J', '1471']
[EX A]: 9330

[EX Q]: 12, 17, ['3889', 'F', 'E', '8903', '2149', '2549', '5827', '7333', '1321', '3', 's', 'e', '2009', '711', 'Q', '7555', 'T', '8479', '8685', 'Y', 'W']
[EX A]: 10275

[EX Q]: 3, 6, ['5053', 'M', '3053', '2693', 'M', '8279', '5667', 'a']
[EX A]:
14025