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.
11, 21, ['3071', 'B', '6273', 'q', 'M', '7821', '5415', '2167', '4849', 'C', '7613', '7153', '1459', 'B', '6417', '3517', '3567', 'r', '4603', '8267', '6771', 'I', 'K']