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.
6, 16, ['t', 'D', 'I', 'o', '811', 'A', '3471', 'M', '23', 'e', 'C', '2919', '7541', 'S', 'O', 's', '1503', 'W', '1959', 'e', '1891', '6493']