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.
11, 15, ['x', '8491', 'w', '4203', '2401', '1199', 'h', '35', 'g', 'W', 'I', 'K', 'h', '9319', 'j', 'I', '3439', 'F', 'H', '1577', '5097', '1137', 'm', '7297', 'Y']