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.
15, 28, ['8365', '177', 'v', '3793', 'g', 'L', '8977', 'm', 'S', '5055', 'r', 'Y', '4571', 'R', 'i', 'u', '2519', '7637', '8863', 'n', 'i', 'g', '4081', 'l', '5405', 's', '8807', 'M', '5023']