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.
21, 25, ['6651', '2243', '685', '1885', 'o', 'f', 'T', '8179', 'z', '9391', 's', '2017', '1643', '2851', '349', '1063', 'G', 'a', 'S', 'e', '463', 'N', 'o', '377', 'J', '7117', 'g', 'T', '1707', '655']