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.
16, 17, ['5919', 'I', 'a', 'i', 'N', 'W', '3799', '7139', '6521', '5127', 'w', '4987', '3047', 'T', 'R', 'K', 'K', 'r', 'Z', 'o', 'E', 'S', 'B', '3083', '9709', '7601', '37', 'y', '5915', 'd']