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.
4, 11, ['G', 'R', '7493', 'Y', 'G', '937', 'Q', '9679', '2549', '2445', 'C', '2289', '3349', 'g', 'T', 'a', '3849', '4873', 'x', 'g', 'c', '6457', '5309', 's', 'S']