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.
12, 16, ['2241', '7161', '6163', '5177', '5143', 'Y', '9001', '6349', '3197', 'L', 'y', 'D', '5967', '7579', '5901', '4553', 'G', 'F']