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.
5, 8, ['O', 'U', '7567', '1311', 'd', 'k', '45', 'v', '8903', 'v', '3847', '795', 'Q', '4915', '9363', '8945', '8799']