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, 20, ['O', '4577', 'B', 'q', 'J', '247', '8491', '9967', 'Z', 'c', '5995', 'j', '1213', 'J', 'c', '6335', 'P', '4337', '953', '7177', '7229', 'f']