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, 9, ['J', '5177', 'm', '7413', 'T', 'N', '5153', 'S', '8145']
[A]: 13298


[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]: 14, 17, ['t', '8227', 's', 'H', '7527', '1471', 'I', 'Q', '1477', '7531', '7727', '7361', 'X', '3001', '5863', 'Z', 'L', 'm', '6575', 'B', '8885', '1141', '7571']
[A]:
8864