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, 9, ['6337', 'o', '5881', 'w', 'R', 'M', 'z', 'y', 'W']

A: 0
****
Q: 5, 9, ['r', 'P', 'r', 'g', '5077', 'T', '2819', 'f', 'p', '6449', '8509', '8915', 'I', 'Z', 'N', '8657', 'R', '3739']

A: 7896
****
Q: 15, 19, ['X', '8731', '9871', 'Z', '8471', 'J', '4511', '5821', 'j', '5951', 'f', '7157', 'd', '6337', '2147', '5103', 'B', '2927', 'b', '5961', 'M', '8955', '3981', 'I', 'U', 'c', '3915', 'Z', 'p']

A:
10177
****