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.
17, 18, ['4437', 'n', 'h', 'W', 'O', '709', 'z', '5519', 'l', 'z', '6407', 'U', '7433', 'U', '4473', '4667', 'z', '7999', 'H', '8377', 'k', 't', '5491', '971', 'v', 'T']