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.
5, 25, ['5229', '1589', 't', 'X', 'S', '7027', '1709', 'V', 't', 'n', 'V', 'H', 'i', 'N', 'F', 'w', 'Y', '4551', '3715', '6521', '9333', 'J', '1031', '9187', 'o', '8229', 'I']