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]: 8, 8, ['9433', '6635', 't', '4425', 'R', '5893', 'z', 'P', 'V', 'f']
[A]: 0


[Q]: 1, 2, ['j', '3613']
[A]: 3613


[Q]: 19, 20, ['H', '7335', 'P', 'i', 'x', 'n', '7435', 's', 'H', 'X', 'P', 'z', '4311', '6391', '1559', 'B', 'O', 'c', '8431', '7761', 'L']
[A]:
16192