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.
16, 20, ['1905', 'E', '1947', '1115', '3523', '5977', 'B', '5917', 'w', 'a', '9135', '6799', '3505', '6665', 'g', '321', '3293', 'U', '9617', 'r', '3825', '847', 'G', '7459', 'Q', 'q']