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.
11, 16, ['U', '1619', 'Q', '4783', '4419', 'U', '6145', '5559', 'q', '95', '909', 'v', '8075', 'i', '3977', '541', '6087', 'G', '6595', '5215', '7617', 'M']