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, 30, ['m', 'r', '5065', '2503', '7287', 'E', 'K', '1213', 'S', '6371', 's', 'q', 'B', '6167', 'q', 'J', 'Y', '7021', 'U', 'J', '1493', 'a', 'u', 't', 'p', '3601', 'D', 'C', 'G', '8621']