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, 18, ['O', 'F', '4611', '3285', '1361', '4923', 'f', 'r', 'E', '4309', '665', 'F', 'K', 'n', '7421', '1407', '5793', 'a', '3563', '5675', 'd', 'i', 'a', '363', '3385', '9167', '1995', '4059', 'Z', '9361']

7200