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, 12, ['6647', '3697', '8483', '6719', 'U', '4169', '1221', '1143', '9149', '95', '3997', '9549', '4883', '6181', '4023', '57', '2237', 'X', 'o', '3419', 'n', 'Z']