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.
9, 22, ['9255', 't', 't', 'X', '2003', 'n', 'j', 'F', '3025', 'u', 'S', '9683', 'v', '6093', 'K', 'L', 'A', 'A', '4093', 'Z', 'A', '8665', 'b', '1691']