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.
19, 20, ['y', 'f', 'i', 'h', '8761', '3495', 'i', 'E', '9197', 'w', '6939', 'O', '3531', '4847', '811', '6595', '1287', 'Q', 'R', '4413', 'F']