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.
22, 26, ['C', '3111', '9247', '9365', 'R', '2813', 'H', 'R', '6455', 'W', 'o', 'A', '611', 'H', 'z', '5585', '4549', 'P', 'j', '1967', '7631', '3887', 'v', '5689', 'F', 'w']