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, ['1961', 'M', '6249', '5877', 'y', '6477', '8351', 'Q', '1', '4259', 'y', 'N', '8979', '1601', '3153', '3879', 'H']