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, 24, ['3585', 'H', '9671', '6963', 'O', 'i', 'c', '5901', '1885', '5485', 'T', 'F', '7545', '4223', 'Q', 'Y', '1253', 'u', 't', '2737', '2227', '7281', '7869', '5817', '8947', 'C']