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: 12, 17, ['L', '6665', 'G', 'Q', 'x', '9031', 'D', '1951', 'M', 'n', '3211', 'F', 'n', 'v', 'q', '6237', '4303', '2709', 'C', 'r']

10540