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, ['195', 'Z', 'j', 's', '6715', 'X', '2325', 'k', 'C', '1327', '4917', '9419', '7057', 'u', '6933', 'O', '2621', 'q', '7595', 'n', 'y', 'q', '3505', '2161', 'U', 'n']