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, 17, ['b', 'o', 'K', 'X', 'C', 'p', '2687', '835', 'C', 'S', '5429', 'z', 'p', '1517', '7891', 'M', '7785', 'c', '1917', '9985', 'w', 'R']