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, 16, ['n', 'b', 'C', 'g', 'z', 'f', 'W', 'J', 'L', 'W', '2437', '5333', 's', 'D', 's', '929', 'm', 'l', '8637', '1921', '1697', 'M', '6099', 'a']