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.
12, 13, ['6565', '4087', 'D', 'm', 'Q', '4597', 'i', 'E', '6295', 'C', '3329', '287', 't', '4567', '9297', 't', 'Y', '9905', 'B', 'H', '8415', '4563', '3939', '3231', 'z', '2227', '6661', 'C', 'w', 'b']