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]: 12, 18, ['9047', '1191', '7027', 'b', '1877', 'n', '337', 'n', 'o', '9007', 'd', 'F', '4929', '2707', 'B', 'y', 'o', '2859', '1609', 'N', 'w', 'H']
[EX A]: 10495

[EX Q]: 8, 11, ['3531', '9933', '9409', 'H', '6391', '2855', 'g', 'E', 'B', 'F', 't', 'C', 'E', 'w', '2563', 'Q', '9495', 'f', 'K', '7073']
[EX A]:
0