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.
10, 22, ['3083', '8301', '1587', '6643', 'H', '9727', 't', '3131', 'x', 'y', '9649', '1679', '245', '5215', '6703', '7949', '3995', '4953', 't', '8079', '1361', 'G', '1341']