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: 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: 6, 7, ['1595', '1523', '157', 'I', '3929', '6313', 'H', 'f', 'e', '93', '5625', 'b', 'J', 'b', '1185', '1505', 'I', 'y', '4043']

A: 6313
****
Q: 15, 17, ['3573', '5065', '2079', '6667', 'n', 'E', '6329', 'c', 'V', 'd', '3207', '5859', '3221', '675', '6563', '8333', 'r']

A:
14896
****