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.
8, 17, ['W', '8609', 'i', '9647', '8381', 'z', 'o', '177', 'O', 'G', 'v', '7017', '8125', 'o', '75', 'l', '3849', '4691', '8229', '6233', 'u', 'j', 'l', 'F', 'j', 'W', '4867']