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, 16, ['3957', '489', 'E', '1005', '2759', 'v', '9169', '2143', '1019', '7041', '6981', 'y', 'R', 'C', 'H', 'E', 'f', 'H', '2877', '6813', 'B', 'Y', '499', 'Q', 't', '7039']