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.
18, 19, ['y', 'n', 'z', '9537', '3381', 'e', 'x', '9595', 'u', '173', '2507', '7651', '1795', '4639', '9375', 'C', 'y', 'w', 'y']