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.
2, 16, ['l', 'n', 'R', '3907', '3953', '3923', '6633', '7099', 'v', '7439', '8949', '7401', '5265', '293', '5653', '7251', 'D', 'L', 'S', '8605', '4033', 'A', 'D', 'M']