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, ['1491', 'L', '301', 'Q', '17', 't', '1577', 'd', 'E', '1017', 'P', '6735', '7513', 'p', '9323', '3795', 'v', '355', '1637', 'Z', '7741', '9031', 'w', '2985', '2531', '7365', '5977', '687', '6235']