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, 21, ['g', 'c', '5571', 'Q', '7757', '1873', '8247', '8901', '5371', 'A', 'W', 'Z', 'S', '1027', '2815', '9811', 'R', 'Z', 'J', 'j', 'e', '5667', 'P', '7071']