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, 10, ['3907', '1629', 'v', '6711', '8347', 'E', '4067', 'T', '1665', '5735', '4879']
[A]: 19814


[Q]: 1, 4, ['3757', 'z', '9029', '6903', '7185']
[A]: 19689


[Q]: 1, 8, ['X', 'X', '3311', '6367', 'r', '2261', '4205', '7017', '6899', 'A', '6417', 'O']
[A]:
23161