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, 27, ['O', '4985', '525', 'U', 'B', '4689', 'u', '2891', 'A', 'O', 'u', 'T', 'Z', '81', '9747', 'O', '2135', 'U', '8637', '3927', 'X', 'z', 'W', 'h', '6347', 'L', 'c', 'H', 'q']

A: 38454
****
Q: 1, 4, ['z', '4241', '5363', '9843', 'H', '6029', '6415', 'S', '6299', 'A', 's', '4481', '8287', '6067', '901', 'o']

A:
19447
****