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.
2, 16, ['3989', 'h', '2759', '2021', '9619', 'v', 'G', '3517', '2803', 'F', '9427', 'g', 'i', 'y', '9765', 'g', '7367', '7941', '2767', '6335']