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, 25, ['4979', '2257', 'c', 'q', 'r', '7547', 'j', '8917', 'S', '8139', '1007', '9799', '4321', '8545', '9143', 'C', 'C', 'p', '1153', 'K', '747', 'e', '4661', 'R', 'e', '8373']