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, 28, ['2201', '6273', '1631', 'Q', '3287', '533', '9495', '4515', 'f', '8987', '4491', 'K', '983', '8341', '5753', 'v', 'g', '8173', '3525', 'F', 'C', 'z', '4665', 'l', 'w', '5463', 'Y', 'o', 'Z']