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

A: 6345
****
Q: 6, 6, ['V', '8015', 'N', 'O', 'Z', 'V', 'v']

A: 0
****
Q: 1, 5, ['3061', '3119', '4671', 'h', '1993', 'd']

A:
12844
****