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.
1, 16, ['c', 'r', 's', '2681', 'S', '1827', 'O', 'f', '3671', 'R', '2621', 'H', 'L', '6737', 'l', 'G', 'V', '1889', 'c', '4933', '6297', '5951']