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.
10, 12, ['2439', '6779', '1091', 'Q', '3601', 'l', 'l', 'E', '2723', 'k', 'l', '2585', 'S', '9075', '6261', '5445', 'y', 'f']