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.
17, 25, ['Q', 'q', 'f', 'D', 'M', '9389', 'M', 'h', '3487', '7255', '8077', '6213', '2439', '9617', '5257', 'K', '6419', 'r', '4531', 'x', 'q', '9141', 'w', '7363', 'B', 'R']