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.
5, 6, ['s', '6609', 'X', '6185', '1971', 'g', 'c', 'L', 'A', '3435', 'G', 't', '4255', 'C', '7571', '3147', 'k', '39', '1841', '6885', 'g']