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.
17, 23, ['d', 'u', 'u', 'P', 'D', 'g', 'M', '8893', 'J', '6277', 'h', '4837', 'Z', '4593', 'N', 'X', 'v', '1577', '5827', '2251', 'N', '4243', '2037', 'b']