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.
15, 17, ['Z', '8591', 'R', '4313', '1835', '3741', '887', 'c', 'h', 'o', '5033', '2867', 'C', 'Q', 'W', '833', 'J', '9907', 'I', '8851', 'I', '6985', 'h', '4785']