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.
11, 13, ['1769', '9363', '379', 'M', '2875', 'H', 'a', '7661', 'T', '4341', '135', '5465', '5979', 'v', 'H', '897', 'e', '725']