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.
19, 22, ['3071', '2941', '4089', '9961', '8283', '9411', 'R', '5185', '9089', 'i', '8009', '8079', 'B', '9175', 'C', 'q', 'M', '5479', 'C', 'K', 'W', 'F', 'D', '7061', 'r', 'S', 'L']