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, 17, ['Y', 'M', '8075', '2825', '267', '9977', '8449', 'M', '2917', '6095', 'W', '7305', '7449', 'G', '4087', 'N', '9451', 'b', '7451', 'X', '2273', '2847']