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.
7, 11, ['S', 'b', 'M', '2825', 'I', '1127', '4311', 'Y', 'T', 'y', 'Z', 's', '7551', 'N', 'N', 'l', '179', 'V', '1', '3653', 'l', 'r', '7103']