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.
17, 21, ['6511', 'L', 'i', '8913', '4735', '3645', 't', 'k', '3533', 'P', '7705', 'x', '1333', '6153', '3871', '1011', 'g', '6149', '8605', '9975', '2665', 'P', '1585', 'a', 'U', '5323', '9865']