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, 15, ['m', '9111', 'O', 'l', '6173', 'B', '1779', 'Y', 'a', '3929', 'U', 'D', 'E', '7517', 'U', 'Q', '6875', '7627', 'b', 'Q', '5093', 'A', '1955', '4987']