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.
11, 18, ['2807', '7191', 'f', 'u', 'i', 'Q', '4155', '2301', 'K', '6135', '3173', 'B', '4825', 'x', '8985', 'w', '7061', 'Q']