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.
2, 6, ['1813', 'u', 'D', 'O', '2091', 'E', '1407', '6983', '3755', 'Q', '2901', 'G', 'c', '3415', 'v', '1639', 'r', 'N', '195', '5919', 'Q', 'u', '8939', '6321', '6591', 'J']