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.
3, 15, ['2889', '7557', '7199', '9625', 'z', '8099', 'D', '3437', 'S', '6019', 'r', '8479', 'x', 'q', 'i', '5023', '3475', 'S', 'U', 'A', 'p', '5557', 'D', 'o', 'm', 'g', 'I', 'u']