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, 19, ['t', '6575', '9683', '6843', 'q', '7721', 'O', '4139', '5085', '7903', 'i', 'V', '865', '6641', 'H', 's', 'W', 'M', 'U', '6173', 'K', 'T']