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, 20, ['l', 'X', '4497', 'D', 'l', 'B', 'L', '7851', '1393', '4067', 'O', '9703', 'v', '2237', 'c', 'C', '9981', 'u', '3643', '4405', '4843']