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.
9, 16, ['5117', '625', '5253', 'h', '9557', '8251', 'X', 'D', '5859', 'u', '1631', 'j', 'D', '9185', '4967', 'S', 'd', 'i', 'I']