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, 6, ['S', 'i', 'F', 'w', '6345', 'L', '9727', 'u', 'F', '7911', 'K', '3151', '6181', 'N', 'a']
[EX A]: 6345

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

[EX Q]: 9, 12, ['5333', '4625', '6523', '2959', 'j', 'X', '8841', 'l', 'I', 'u', '4125', '9691', 'V', 'e', 'w', '841', 'g', '8809', '1437', '3699', '761', '1517', 'x', '779']
[EX A]:
13816