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, 17, ['y', '3997', '8559', 'Y', 'c', '1121', '3597', '4333', '8643', '2209', '3013', 'y', '2057', '1333', 'M', '8519', '2293', '3679', '863', 'X', 'c', 't', '8399', '7757']