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]: 4, 5, ['t', '9215', 'K', 'Q', 'w']
[A]: 0


[Q]: 2, 9, ['3707', 'J', 'H', '8907', '597', 'Z', '9725', 'g', 'R']
[A]: 19229


[Q]: 12, 12, ['7353', 'f', 'N', '4681', 'z', 'd', '2977', '5643', '7305', 'Y', '7053', '3315', 'q', '4869']
[A]:
3315