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, 11, ['u', 'o', '1215', '6769', 'F', '5761', '6553', 'M', '6535', '5869', '4073', '2505', 'J', '4113', '9625', '9595', '2907', 'c', '7681', '3739', '3441']