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.
5, 17, ['357', '111', '1267', 'w', '5633', 'h', '703', '3959', '4801', 'k', '8269', 'q', '9661', '8783', 'c', '2189', 'V', '5255', 'F', 'z', '5811']