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.
9, 16, ['I', 'm', '519', 'l', '8577', '8687', '8575', '7401', '8701', 'D', '8343', '7293', '2463', 'Q', 'W', 's', '8527', 'r', 'j', 'y']