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.
5, 7, ['1997', '7309', '3909', '5871', 'Q', 'J', 'E', 'U', 'f', 'w', 'j', 'V', 'Z', '8989', 'f', '5217', 'z', 'P', '6079', '8067', 'G', '3501', 'B', '3719', '6111']