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, 26, ['6123', '809', 'A', 'w', '7795', 'a', 'Q', '6545', 'w', 's', 'j', '3383', '1551', 'w', 't', '1639', '7217', '8557', '2823', 'N', '7865', '3549', 'z', 'm', '6589', 'U']