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, 23, ['2959', 'H', '7105', 'b', '3147', '7681', 'd', '3093', 'h', 'i', 'n', '6775', 'Z', 'm', 'N', 'x', '6809', '7619', '1601', '4409', '1027', 'u', '4387', '355', 'u', 'v', '2439']