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.
21, 22, ['J', '5465', 'O', 'S', '7771', 'H', '2503', '7467', 'N', 'Y', 'x', '4893', '1625', 'M', 'W', '3073', 'n', '4623', '7851', '659', 'j', '6573']