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, 11, ['y', 'M', 'C', 'q', '4071', 'A', 'm', '8885', 'n', '7725', 'k', 'I', 'G', '615', 'r', 'z', 'i', '3641', '4011', '4047', 'V', '497', 'u', 'B', 'j']