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, 15, ['2361', 'h', '7485', 'v', '5801', '2405', 'D', 'n', '4575', 'L', 'F', 'S', '4743', 'K', 'U', '4277', 'f', 'e']