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.
9, 21, ['d', 'B', '5045', 'k', '2551', 'n', 'C', '8637', '1359', '9795', 'A', '6517', '8031', 'y', '1169', 'b', '6659', 'N', 'H', 'a', 'g', '6529', 'h']