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, 2, ['R', '979', 'H', 'W', 'y']
[A]: 979


[Q]: 6, 7, ['k', 'F', 'I', '1481', 'v', '5085', 'V', '9661', '525']
[A]: 5085


[Q]: 3, 11, ['9531', 'X', '3373', 'h', '7665', '5781', 'h', '5653', 'L', '6857', 'F', 'p']
[A]:
29329