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.
6, 21, ['233', '5393', 'r', 'O', '7979', '7679', '3121', 'f', '9291', 'S', 'T', 'b', 'D', '335', 'L', '7619', 'W', '8379', 'p', 'd', 'o', 'c', 'o']