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.
16, 18, ['3141', '3931', '6383', '7071', 'f', '655', '7011', 't', 'u', '6841', 'q', 'W', '5937', 'S', 'n', 'Y', 'w', '271', '9985']