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, 21, ['C', 'Z', 'U', '2843', 'z', 'z', '5933', '1681', 'q', '5191', '2901', '1067', 'R', '7891', 'w', '3621', '2477', 'I', 'e', '5161', 'c', 'G', '681', '5043', '3919', '4569', 'Y', 'F']