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]: 14, 26, ['U', 'D', '5391', '2975', 'b', 'b', '8741', '8991', '9083', '5401', '481', 'q', 'j', '8757', 'C', '2027', '6683', '5667', 'R', '631', 'm', '3743', '9769', '1039', '923', 'Q', '4373', '7451']
[EX A]: 39239

[EX Q]: 8, 22, ['h', '2971', 'l', 'F', 'e', 'f', 'b', 'I', 'b', '4759', 'm', 'w', '6179', 'R', '2875', '3469', '3801', 'm', '6987', 'A', 'c', '6303', '8135', 'c']
[EX A]: 34373

[EX Q]: 12, 16, ['G', 'W', '8965', 'Z', '8197', '9017', '3425', 'G', '1085', '6431', 'Q', '8201', 'u', '7229', '5853', '8763', '7403']
[EX A]:
30046