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, ['A', 'Z', 'h', '2161', 'R', 'g', '9615', 'V', '9977', 'G', 'n', 'y', 'W', 'w', 'Z', '1977', '8245', '6623', 'E', 'z', 'n', '5875', 'n', '4139', '1209', 'V', 'N']