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.
2, 11, ['9307', 'y', 'v', '1669', '657', '133', 'E', 'g', 'm', 'K', '57', 'a', 'p', 'I', '7865', '2929', 'j', '6417', '1961', 'o', '5813']