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]: 1, 3, ['Z', 'X', 't']
[A]: 0


[Q]: 3, 5, ['X', '8101', 'v', '283', 'v', 'O', 'Y']
[A]: 283


[Q]: 1, 9, ['M', '9297', '181', 'o', 'U', 'I', 'B', '4877', '2715', 'v', '7587', '3207', '5929', 'B', 's', '3897', '5315', '8089', 'D', '2659', 'p', '2589', 'H', '6445', 'r']
[A]:
17070