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.
16, 18, ['4991', 'V', 'm', '8135', '8941', 'p', 'S', '9407', '2707', 'l', 'O', '9223', 'e', '3877', 'b', '459', 'w', '9651', 'N']