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.
1, 5, ['4059', 'j', 'S', '4735', '7109', '2283', '6647', '5215', 'D', 'H', 'S', 'U', 'y', '8465', 'x', 'K', '6895', '1923', '5789', '3287', '8127', '8323', '2533', 'L', '8251']