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, 11, ['4103', '1171', 'S', 'H', 'o', 'Y', '2655', '9681', 'v', '9391', 'K', '5243', 'B', '9997', '9813', 'r', '4003', '253', '7499', '7255', '6835', 's', '6449', 'x', 'm', '5021', '3017', 'V', 'O']