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, 7, ['o', '3377', 'x', '9385', 'z', '9963', 'S', 'h', 'l', '1525', 'k']
[A]: 22725


[Q]: 4, 9, ['9557', '1661', 'E', '5173', 'o', '4963', '2811', '5471', '3853']
[A]: 22271


[Q]: 1, 5, ['a', '1659', 'X', '5053', 'C', 'k', '4901', '3847', '6991', 's', 'C', '2299', '69', 'z', 't', '5465', 'Y', 'm', 'l', 'j', 'O', 'E', 'q', '1817', '1923', 'w', 'O']
[A]:
6712