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.
15, 18, ['6711', 'O', 'T', '7525', '5455', 'E', '3303', 'P', 'D', 'u', '3773', 'e', '8267', 'm', '9455', '2051', '6009', '7963', '9379', 'Q', 'H', 'i', 'S', '8259', '751', 'K', '6853', '3769', '3221', 'M']