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.
13, 15, ['i', 'I', 'Y', '6925', 'Z', '8419', '7771', '3015', '1695', '745', 'Y', 'e', 'V', 'm', 't', 'F', 'J', 'e', 'N', '2973', 'o']