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, 17, ['9581', 'a', 'B', '7387', 'f', 'K', '9837', '8031', 'S', 'G', 'j', '2829', '443', 'q', '6709', 'k', 'z']