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.
11, 16, ['109', '9767', 'Q', 'a', 'W', '1251', '5147', 'U', '6539', 's', 'L', '3077', '9521', 'n', 'X', '4177', '4005', 'L', 'G']