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.
16, 29, ['o', '6899', 'J', '6777', 'c', 'z', '7125', 'w', '6359', '9583', '3583', 'h', 'x', 'Q', '9291', 'H', 'l', 'x', 'Q', 'a', '8471', 'L', 'p', '3451', 'M', '5945', 'p', 'F', '8877', '5693']