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, 17, ['g', '2841', 'y', 'k', '6555', 'S', '3925', '9621', 's', 'M', 'u', 'i', '5563', 'S', 'L', '1567', '4409', 'j', '4661', 'j', 'Y', 'x', 'd', 'w']