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.
12, 22, ['q', '199', 'z', 'y', 'O', '9943', 'd', '8299', 'f', 'z', 'O', 'W', '3331', 'm', 'B', 'L', '433', '1777', '663', '2011', '2689', '7873', '633', 'X']