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.
2, 17, ['x', '1231', 'b', 'z', 'a', '9501', 'G', '5399', '905', '6317', '1023', 'J', 'g', '179', 'F', '6933', '8469']