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, 17, ['d', '8293', '2241', 'X', '3185', '1899', '2383', 'O', '8177', '8225', 'A', '4017', 'G', '2689', '9189', 'I', 'O']