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.
8, 15, ['z', '8629', '1391', '821', '4371', 'M', '5213', 'm', '8013', 'S', 'V', '2517', '9957', '5111', 'u', 'y', 'H', '7355', 'j', '6515', '7711', '2397']