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.
7, 20, ['y', 'E', '6659', 'D', '2693', 'Z', '7765', 'v', '7477', 'H', 'L', '8041', '9823', '6921', 'j', '2165', 'w', '2855', 'Q', 's', 'S']