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.
8, 20, ['4711', 'w', '187', '8769', 'O', 'B', 'g', '6475', 'm', '4299', 'b', '7321', '9367', '1791', '9475', '7581', 'H', 'x', '6605', 'I', '4437', '6941', '1545', 'Y', 'x']