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, 20, ['901', 'O', '7047', '1351', '8625', 'F', '5495', 'N', 'U', '6571', '1077', 'k', 'H', 'a', '1547', '6207', 'A', '1297', '3433', 'G', '2415', 'C', 'Y']