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.
10, 13, ['K', '3559', 'G', '9475', 'U', 'O', 'F', '1153', '8307', 'I', 'V', '7193', 'b', '1751', 'T', '4133', 'g', '7459', 'u', '6221', '3231', 'e']