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: 6, 12, ['o', '1757', '7157', 'g', '6361', 'F', '9293', 'E', '917', '2451', 'e', 'z', 'J', '9181', 'N', '9265', '3531', 'G']

12661