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.
20, 21, ['y', 'L', 't', 'l', 'z', '5779', 'H', '2077', '3877', '8057', 'y', '769', 'S', '3939', '3179', '9037', '5965', 'L', 'T', '5283', 'B', '2691', 'f', 'f', 'q', '8925', 'x']