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.
14, 16, ['X', 'S', '645', '707', '9199', 'L', 'F', 'H', '7471', '6335', 'E', '8741', 'z', '8981', 'X', 'd', 'I', 'j', '281', 'b', '4587']