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.
18, 25, ['4001', '979', 'x', '5529', 'Y', 'R', '1301', 'F', 'M', '3643', 'k', '2905', 'D', '9519', '5197', 't', 'z', 'n', 'G', 'n', '8653', 'R', '173', 'X', 'b']