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.
19, 25, ['v', 'k', 'P', '1615', 'I', 'P', 'd', '6209', '8839', '9839', 'u', 'y', '675', 'f', '4571', 'x', 'z', '139', '6711', 'r', '2711', '9881', 'U', 'B', '5959', '1613', 'y']