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.
12, 21, ['C', 'f', 'F', 'k', '9891', 'p', '8751', 'a', '2261', '7277', 'E', '345', 'Y', 'W', 'J', '295', '3569', 'm', 'b', 'i', 'H', '8567', '4827', 'f', 'O', 'a', '2797', 'H']