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.
6, 9, ['k', 'J', '5571', 'Q', 't', 'R', '1939', 'Q', 'b', '3943', '2591', 'a', '277', 'y', 'K', '5171', 'H', 'q', 'h', 'w', 'S', 'c', '4901', 'u', '7027', '7721', '5983']