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, ['W', '657', '9745', '9591', 'I', '6417', 'i', 'D', 'q', 'd', '2285', 'z', '4605', 'f', 'r', '7133', 'j', '695', 'f', 'K', '4579', 'A', 'c']