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, 6, ['x', 't', '9767', '4787', 'T', 'e', 'Y', '8919']
[EX A]: 0

[EX Q]: 4, 5, ['t', '9215', 'K', 'Q', 'w']
[EX A]: 0

[EX Q]: 11, 12, ['B', '9811', '789', 'n', '8027', 'd', '8089', 'z', '4917', '1745', '7971', 'B', '7787', 'm']
[EX A]:
7971