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.
13, 25, ['5519', '1279', 'o', '9607', '9177', '8799', '5769', '9921', 'n', '5213', 'O', 'p', '2217', '6413', '3185', '327', '9817', 'J', 'Z', '8683', '5321', 'T', 'c', '3425', '981', '5073']