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.
7, 21, ['2201', 'o', 'W', 't', '3275', '4621', '5349', '4901', 'S', '3699', 'L', 'k', '6451', '345', '8793', 'B', '3325', '3563', '9139', '3801', 'S', '9443']