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, ['q', 'o', '7723', 'Q', 'R', '8849', 'o', '5091', '8763', 'M', '1259', 'X', '9909', '2769', 'F', 'C', '2735', 'r', 'd', '6903', '3371', 'r', 'T', 'e', '1831', 'y']