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, 17, ['F', '7937', '2911', '3373', 'A', '8541', 'q', 'J', 'L', 'G', 'Y', '5755', '7447', '741', 'F', '9869', '3799', '9281', '9647', '4185', 'S', '413', '3819', 's', '7777']