Definition: 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.
Input: 1, 3, ['9709', '8777', '8813', '8261', '7527', '7205', 'm', '8131', '7973', 'W', '8287', '5863', 'G', '9423', '1577', '8803', 'w', '7071', '6701', '9889', 'w', 'q', 'C', 'c', 'N', '9569', '2073', '1301', 'd', 'b']

27299