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.
6, 29, ['353', '3025', 'j', 'm', 'B', 'r', 'r', 'S', '5509', 'U', '3611', 'P', '8735', 'E', 'p', 'I', '9829', '3705', 'I', 'h', '9007', '1217', 'H', '9793', 'n', '5829', 'W', '3933', '5353']