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.
5, 17, ['9149', '8399', 'J', '7437', '7119', 'K', 'm', 'I', 'C', 'z', 'h', '6865', 'l', '8117', 'm', 'U', '6717', 'M', 'g', '7417', 'T']