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.
13, 20, ['Q', '7931', '4189', 'x', 'F', '3765', 'y', '8985', '8161', 'F', '8389', 'h', '6601', '6197', '5083', '3625', '1997', '8961', 'E', 'Z', '2553']