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]: 1, 6, ['8527', '3499', 'M', 'f', 'V', 'B']
[A]: 12026


[Q]: 3, 6, ['8023', '9999', '9501', '8175', 'o', 'l', 'p', '2877', 'E', 'd', '9917', '113']
[A]:
17676