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, 21, ['N', 'G', '7165', 'y', 'r', 't', 'K', 'y', '8459', 'j', '9919', '9535', '4843', '6463', '8153', 'z', '1599', '941', '4059', '1827', 'g', 'c']