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.
21, 26, ['I', 'H', 's', '4089', 'V', '2761', '2935', 'V', '4123', '4071', '4069', 'S', 'p', 'j', '4261', '5395', 'n', '4597', '317', '4553', 'u', 'F', 'Q', '2711', 'R', '9915']