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.

Q: 5, 21, ['f', 'c', 'y', '1711', '3261', 'I', '3249', 'O', '7875', 'm', '7665', '375', 'V', '4561', 'v', 'J', '2809', '2081', 'i', 'v', 'S', 'f', '8393', 'P', 'r', '4103', 'q', '1141', '9971', '671']

A: 31876
****
Q: 2, 2, ['V', 'a']

A: 0
****
Q: 13, 16, ['9193', 'C', 'u', '7511', 'F', 'U', 'Q', 'l', 'F', '9961', 'P', 'C', '6401', '4785', '6449', 'C', 'k']

A:
17635
****