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.
3, 21, ['2567', '2471', '5569', '5191', '5767', '9783', 'H', 'N', 'U', '6651', '4233', 'g', 'M', '871', 'w', '3869', 'r', '1987', '4551', '7029', '7923', '7701']