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]: 2, 8, ['6901', '3901', '5101', '4297', '1099', 'q', 'z', '6615', 'z', '6859']
[A]: 21013


[Q]: 1, 14, ['J', '4147', 'z', 'M', 'Z', 'd', 'f', 's', '5083', 'L', '7107', 'g', '7047', 'E', '5931', '141', '6889']
[A]: 23384


[Q]: 2, 8, ['7713', 'B', '4685', 'P', '8915', 'F', 'x', '8469']
[A]:
22069