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, 16, ['G', '479', 'C', 'I', 'R', 'H', 'Z', 'P', '4081', 'D', '7569', 'N', 'j', '1837', '1819', '2119', 'u', 'I', '6281', 'j', 'o', '5807', '7335', 'o']