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.
5, 17, ['T', '391', 'K', 'm', 'Y', 'C', 't', 'J', '8847', 'Q', 'a', 'w', '2785', '2171', 'p', '8697', '3823', 'c', '3217', 'Z', '3857', 'd']