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, 19, ['1307', '4173', 'n', '4275', '9583', '5457', '9811', 'T', 'E', 'z', 'y', '1983', 'B', 'h', '2031', 'l', '9987', '7297', 'F', '6631', '8461', 'L', '6279', '3415', 'o', 'C', 'g', '8971', '9647', '3107']