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, 17, ['t', 'o', '8725', 'z', '3323', 'I', 'h', 'X', 'U', 'y', 'p', '75', '2727', 'l', 'k', '4779', '6215', 'T', 'T', '6391', '2755', 'i', '6973', '7721', '7371', 'k']