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.
11, 18, ['F', 'b', '4109', 'l', 'p', '5799', 't', 't', '275', 'Z', '9667', 'y', '2879', 'O', 'D', '8723', 'i', '7641', '6521', '6423', '6991', '1709', 'x', '8985', 'O', '743']