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.
8, 16, ['2893', '6465', 'n', '4499', 'r', 'L', 'q', 'N', 'b', '4165', '7953', '2903', '3361', '5081', 'j', '8919', '4117', 'H', '6639', 'r', 'e', 'j', 'D', '1607', 'V', 't', 'C', 'P', 'h', '4371']