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]: 5, 15, ['r', '6933', '8849', '3479', 'H', '4269', '7469', '9359', 'K', '3371', 'A', '5371', 'z', 'K', '6147', 'i', 'Q', '9055', 'b', 'g', 'x', '5357', 'L', '2797', '7683', 'L', '7127', 'M']
[A]: 35986


[Q]: 1, 2, ['m', 'E']
[A]: 0


[Q]: 16, 25, ['H', 'Z', 'y', '5807', 'c', '2683', '8017', 'S', '4779', 'Z', '3823', '4081', '5379', 'Q', 'D', 'j', '4381', 'F', 'o', 'q', '7513', 'h', '5101', 'O', '4391']
[A]:
21386