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.
15, 18, ['X', 'U', 'I', 'l', '9503', 'd', 'U', '2603', 'C', 'X', 'D', '9327', 'J', 'g', 'K', '9047', 'D', 'x', '6439', '6323', 'H']