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, 29, ['A', 'J', 'w', 'I', 'X', 'T', '2161', 't', '271', '6941', 'B', 'y', '6505', '6859', '3981', 'H', 'H', 'S', '8977', '9497', '8715', '3207', '6251', 'D', 'D', 'v', '841', '6479', '9053', 'u']