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, 28, ['o', 'W', '1825', 'X', '6499', 'w', '8997', '1947', 'd', '6999', 'z', 'Q', '947', 'Z', '1087', '3885', 'q', 'W', 'E', '3043', 'y', '3937', 'W', '7763', 'v', '3669', 'H', 'u']