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.
20, 29, ['q', 'S', '6517', '2311', 'z', '3789', 'S', 'M', 'b', '2525', 'E', 'M', 'J', '8665', 'b', '4039', 'Q', '7577', 'N', 'a', 'l', 'N', '7721', 'H', '6213', 'g', '757', 'z', '9783', '8805']