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, 15, ['3897', '6809', '2537', '6661', 'p', '7665', 'x', 'P', '8735', 'z', 'Q', 'Q', 'R', 'f', '6729', 'q', 'g', 'm', '7279', '6557', 'm', 's', 'v', '8457', '3695', '1435', 'Y', 'Z']