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.
9, 21, ['6003', '3083', '325', '2593', '7879', 'f', 'L', 'e', 'v', 'I', '4553', 'V', 'c', '7423', 'C', '8381', 'l', '2975', '1973', 'T', 'D', '5515', 'W', 'X', 'L', '1897', '7805', 'I', '3201']