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.
12, 27, ['E', '6809', '1239', 'K', 'c', '8559', '4525', 'l', 'N', '3885', 'D', 'u', '2799', '7679', 'w', '9075', '5705', 'O', '5227', 'x', 'p', 'o', '3835', '4117', 'n', 'z', '6481', 'D']