Definition: 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.
Input: 16, 17, ['f', 'g', 's', 'm', 'A', 'i', 'O', 'Y', 'O', '1013', '5721', 'n', '889', '771', '5565', 'C', '5211', '2647', 'M']

5211