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, 6, ['9291', 'W', 'y', '8785', 'C', 'w', 'g', 'W', 'Z', '2395', 'K', '6257', 't', '3069', '8911', '3243', 'g', '9441', 'I', 'g', '5427', '6939', 'h']