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.
8, 9, ['q', 'l', 'Q', 'U', 'w', '1715', '2639', 'o', '4537', '6615', '5759', 'J', '5943', '309', '3013', 'm']