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.
3, 19, ['F', 'r', 'i', '3983', '213', '5567', '1101', 'Y', '3859', '5467', '6345', 'H', 'Z', '2069', '4569', 'g', '9535', 'I', 'A', 'n']