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.
10, 20, ['6635', 'H', 'Y', '6327', 'J', 'M', '4071', '5217', '2589', '1207', '8645', '6673', 'K', 'q', '7013', '5917', '5781', 'c', 'l', 'i', 'R', 'c', 'C', 'K', '6783', '4531', 'E']