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.
2, 21, ['q', '9161', 'q', 'i', '2163', 'n', '3425', '3611', '4429', 'I', '1557', '7997', '8307', 'E', '759', '557', '1813', '1581', 'U', 'G', 'S', 'C']