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]: 1, 3, ['F', 'N', 'N', 'r', 'X', 'R', '3477', 'T', 'z', 'v', 'B', 'Q']
[EX A]: 0

[EX Q]: 5, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']
[EX A]: 29965

[EX Q]: 3, 5, ['9531', 'e', '7283', '5879', 'd', '9039', 'w', 'T', '5675', '4533']
[EX A]:
13162