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, 10, ['9139', 'F', 'e', 'F', '8979', '831', '6811', '3677', '2937', '1001']
[A]: 33375


[Q]: 2, 3, ['3335', '3451', 'f', 'M']
[A]: 3451


[Q]: 8, 9, ['3397', '3129', 'J', '2051', '3929', 'P', 'S', 'j', 'X', '2153', '3619', '8859', 'D', '3727']
[A]:
0