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, ['y', '7919', '5621', 'Y', 'j', '1373', 'q', '8367', '3851', 'o', '8787', '441', 'O', '461', 'a', 'E', 'c', '1955', 'k', '3569', '8491', 'K', '5883', 'D', '9643']