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, 21, ['1785', 'y', 'S', '2867', '9659', '7683', 'Y', '5723', 'h', 'y', 'e', '7955', '8215', 'O', 'l', '2657', '1307', '4311', '3165', 'N', '9845', 'c']