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, 16, ['2373', 'l', '7649', 't', '8629', '711', 'F', '8949', 'Z', '1533', 'E', '6087', 'p', 'M', '3255', '3745', 'p', 'P', 'b']