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.
8, 25, ['s', '8375', '4367', '2281', '2081', '7987', '4765', '7081', 'd', '7185', 'R', 'L', '4843', 'b', 'I', '9799', 'W', '5507', 'R', 'a', 'G', '2333', 'z', 'E', '9877', 'l', 'l', '1439', 'K', 'z']