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, 15, ['3451', '893', '2535', '1017', 'Z', '181', '5357', 'x', '8961', '9569', '5405', 'V', 'I', 'U', '8189', 'P', 'U', '327', '2375', 'Q', '6349', 'Z']