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.
6, 15, ['v', 'm', 'y', 'N', '1967', 'L', 'y', '5003', '4719', 'j', '3909', 'V', '6655', '5293', 'l', 'U', 'O', '199', '3987', 'b', '1683', '4153', '8975']