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, 9, ['9069', 'U', '6879', 'q', '8619', '5335', '8765', '7825', '9621', 'H', '9769', 'E', 'v', '1921']
[EX A]: 40165

[EX Q]: 1, 2, ['9769', 'z', '6349', 't', '9391', '7181', '2405', 'j']
[EX A]: 9769

[EX Q]: 1, 3, ['4517', '7867', 'e', 'A', '1029']
[EX A]:
12384