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, 23, ['1579', 'x', '735', '2923', '8789', '3073', 'v', 'B', '9789', '8509', 'O', '8869', '2413', 'n', 'x', '7695', 'D', 'V', 'k', '1077', 'r', 'W', '6593', '5383', 'l', '2999', '8773', 'C', 't']