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.
6, 17, ['7117', 'L', 'k', 'g', 'V', '2367', 'z', '5981', '3431', '3881', '1161', 'a', 'Y', '6853', '345', '2007', '4523', 'n', '1835', '975', 't', '2995', 'e', '8893', 'I', 'J', '497']