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: 9, 9, ['8633', 'O', 'N', '3323', '1975', '8707', 'c', 'm', '8357', 'A', 'n', '8931', '9021', 'i']

A: 8357
****
Q: 1, 18, ['1137', '7521', '1291', 'o', '391', '5329', 'X', '391', 'i', '6893', '8547', '9361', 'Z', 'O', '9701', '4097', '9273', '3877', '1589', '9097']

A: 67809
****
Q: 1, 1, ['8561', '9401', 'Z', 'l', 'p', '9435', '7503', '6281', 'Z', 'K']

A:
8561
****