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, 9, ['4277', '9299', 'g', 'V', '5525', 's', 'c', '1195', '7099', '5933', '8867', '2141', '3393', '5283', 'z', 'o', 'o', 'V', '3769']