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.
9, 16, ['3787', '5195', '7117', '709', 'k', '8279', '5461', '985', 'Y', 'Z', 'Q', '2921', 'x', '6917', '7953', '5289', 'l', '2669', '3349', '1035', '8793', '8879']