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.
3, 23, ['D', 'S', 's', 'b', '8101', 'G', 'v', '2147', '2603', 'Y', '6625', '3391', '7919', 'R', '985', '3317', 'P', '533', '6789', '7535', 'S', '7135', 'p', 'Z']