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.
6, 15, ['Y', '8055', '3691', 'a', 'y', 'y', 'D', 'c', '1731', '5495', 't', 'm', '8241', '4899', '5771', '2077', '4061', 'G', '9689', 's', 's', '8959']