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.
9, 19, ['p', 'p', '2351', 'y', 'o', 'l', 'A', '7853', '5513', 'f', 'k', '6545', '8917', 's', 'W', '4015', 'y', '3237', 'I', '453', 'j', '8977']