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.
16, 16, ['2761', '5557', '1853', 'I', 'O', '9095', 'X', 'c', '4331', 'H', 'P', 'r', 'p', '3715', '2225', '3455', 'O', '2299', '5975', '8785', '7831', '2307', 'r', 'y']