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]: 5, 12, ['4439', 'P', 'e', '4929', '2085', 'w', 'C', '5385', '6517', 'w', '6257', '9721']
[EX A]: 29965

[EX Q]: 3, 20, ['5607', 'Z', 'C', 'B', '623', 'r', 'i', '7357', '9051', '8973', '3163', 'X', 'z', '2683', 'x', '9837', '5217', 'f', '1609', '3721', 'w']
[EX A]:
52234