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.
13, 16, ['a', '4509', '6651', '8759', '8195', 'N', 'B', '2457', '9445', '9155', 'q', '2799', '9281', 'h', '5791', '537', 'r', 'L', '4181', '1659', '4771', 'P', 'k', 'M', 'x', '8231', 'j', 'W', '9507']