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: 2, 16, ['v', 'd', '6599', 'd', '9305', '6377', '5009', '3797', '3861', '9421', 'G', 'N', 'm', 'x', 'E', '7047', 'W', '5629', 'j']

A: 51416
****
Q: 1, 3, ['5437', '8521', '9081', 'h', '5453', '5065', '2949', 'P', 'Q', '2853', '7857', 'l', '5217', 'O', 'V', '3585', 't', '2593', 'V']

A: 23039
****
Q: 1, 3, ['6073', '8731', 'L']

A:
14804
****