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.
15, 16, ['9779', '167', '4621', '1181', 'b', '8003', 'J', 'w', '8389', 'P', '2619', 'l', 'x', '7807', 'x', 'v', '1405', 'U', 'p', '1951', 'q', 'J', 'i', 'Y', 'j', 'f', '6637', '8697']