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.
1, 1, ['O', '9739', 'g', '9425', '9997', '8215', 'm', '8611', '5619', 'Y', '9289', 'v', 'M', '1493', 'I', 'M', '8097', 'm', '2137', 'y', 'n', '2751', '1787', 'R', 'c', 'm', 'w', 'C', '7789']