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.
18, 21, ['J', 'z', 'w', 'K', 'Q', '6533', 'W', 'k', 'B', '5215', 'u', '2291', '1765', 'd', 'H', 'o', '3321', '2911', 'p', '4787', 'F', '3993', '4855', 'd', '4017', '5707', 'E', '45', 'n', '8963']