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.
3, 21, ['J', 'A', 'I', 'x', '5979', '405', 'z', '115', '7643', '1327', '8835', '2813', '2307', '7371', '6995', 'W', 'G', 'x', '8711', '6693', '6557', '9509', '3989', '6141', '2399']