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.
1, 28, ['425', '2133', 'X', '2903', '9127', 'X', 'S', 'H', 'E', '6009', 'z', 'U', '983', 'g', '241', 'E', 'a', 'h', '5905', '3763', 'k', '7295', '2195', '2509', 'l', '8281', '1879', 'F']