Instructions: 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.
Input: 5, 10, ['I', 'v', 'G', '9953', 'C', 'W', '303', 'a', 'x', '5883', '7353', 'P', '2841', '5597', '595', 'y', 'o', '6833', '991', 'R', 'r', 'd', '7925', 'c', '5471', 'C', '4595']
Output:
6186