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.
6, 11, ['P', '7395', '7271', '1351', 'c', 'g', 'X', 'b', '8001', '5971', '1611', '3939', '8103', 'l', 'b', '4321', 'w', '3789', '4043', 'w']