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]: 6, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']
[EX A]: 13298

[EX Q]: 5, 6, ['2277', 'k', 'S', '6367', 'q', '5455']
[EX A]: 5455

[EX Q]: 3, 18, ['8731', 'd', 'y', '2627', '6531', 'X', 'k', '5303', 'e', '8885', '477', '3431', '4029', 'M', '4797', '3721', 'd', 'n', 'e', '8249']
[EX A]:
39801