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]: 3, 4, ['9567', '9317', 'l', 'n', 'i', '6993', '2775', '2651', '1311', '2955', '6271', 'b', '7333', 'U', 'd', '6455', 'n', 'o', '1871', 'u']
[A]: 0


[Q]: 6, 25, ['T', '9865', '5113', 'y', '6927', '2557', 'S', 't', 'M', 'w', '5483', '1227', '2607', 'J', 'L', '5119', 'p', 'D', '7353', '4007', 'i', '4201', '2035', 'e', 'O', 'k']
[A]:
34589