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.
9, 16, ['4169', 'M', '3569', 'V', 'P', 'w', '8221', 'C', '7853', 'z', 's', '9301', 't', '6083', 'B', '1137', 'Z', 's', 'V', '731']