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, ['A', '4865', 'X', 'p', '8287', '5909', 'o', 'j', '333', '9551', '7351', '3377', 'B', 'P', '9329', '77', 's', '5269']