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, ['Q', 'A', '1599', '3909', '9041', '6177', '7753', '997', 'A', '2567', '8581', 'n', '9391', 'c', 'A', 'n', 'N', '117', '2233', 'H', '6203', '8413', '7903', 'f', '8511', 'j']