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.
12, 12, ['4037', 'i', 'A', '8383', 'v', 'K', '3765', 'D', 'o', '6999', 'e', 'w', 'k', 'U', '1717', 'W', 'C', 'M', '1589', 'c']