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.
9, 17, ['2645', '8495', '1171', '3673', '4183', '3303', '1997', '2663', 'i', 'o', 'G', 'D', '1519', 'E', '527', '5689', '6923', 'v', '6353', 'H']