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, 20, ['x', 'z', '271', 'M', '1727', '9453', '4017', 'o', '8109', 'X', '5989', '275', 'V', '3019', 'Z', 'K', 'L', '3885', '8699', '6241']

A: 49687
****
Q: 9, 9, ['8633', 'O', 'N', '3323', '1975', '8707', 'c', 'm', '8357', 'A', 'n', '8931', '9021', 'i']

A: 8357
****
Q: 10, 14, ['4569', '1345', 'f', 'B', 'T', '1401', '7827', '2767', 'Y', '5867', '4801', 'T', 'i', 'R', 'Y', '8929', '7129', '5537', '6281', '7151', 'U', 'Z', 'W', '4519', '5823', '7083']

A:
10668
****