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.
11, 13, ['6527', 'Y', 'K', '5597', 'Q', '1181', 'A', 'I', '5507', '9501', '2689', 'z', 'm', '363', '1333', 'w', 'm', '963', '7185', '8099', '1453', '9729', '8881', '6503', 'y', '3537', '1677']