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, ['R', 'x', 'L', '6931', 'r', 'O', 'k', '7979', '8287', '3529', '7133', 'S', 'l', '6047', 'p', '4129', '9907', 'l', '4309', '1719', '1145', 'a', '1543', '3197', 'T', 'L', 'x', 'O']