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.
13, 22, ['z', 'L', 'y', '6189', 'E', 'O', '2157', 'u', 'Q', 'Z', '2509', '6209', '5005', '3801', '9009', 'q', 'R', '8979', 'L', 'A', 'i', '1905', '2573']