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.
10, 16, ['k', '1423', '8859', 't', '4503', 'Z', '505', 'R', 'X', 'x', '2159', 'O', '361', 'a', 'F', '9685', 'f', 'A', '4579', 'W']