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, 16, ['1', '8843', '8385', '1275', 'O', 'Y', 'l', '599', 'L', '4775', 'E', 'z', '4469', '6641', 'W', 'A', 'L', 'L', 'B', 'j', '6877', 'n', '4267', 'l', '2795', '9097', 'O']