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, 19, ['8925', '2507', 'O', 'q', 'e', 'P', '7503', 'N', 'k', '2967', '3669', '3201', '6523', '107', 'E', '1593', '525', 'W', 'P', '4447', 'U']