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.
1, 20, ['G', '3631', '9201', '8517', '6803', '593', '8275', '4367', '5301', '5961', '6065', 'h', 'q', 'K', 'X', 'b', 'b', '3663', 'k', 'n', '9357', '6871', '5057', '4691', 'F']