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, 17, ['T', 'B', 'r', 'E', '8265', 'Q', '953', '3129', 'x', '5703', '4423', 'm', 'b', '6869', '1427', '3809', '5371', 'l', 'X', 'W', '8875', '9161', 'w', '6467']