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.
6, 12, ['8967', '5317', '4129', 'P', '769', 'F', '9723', '7833', 'i', 's', 'Q', 'g', 'x', 'E', '1769', '8867', 'B', 'b', 'Q', '6359', '6207', 'A']