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, ['H', 'L', '5479', 'w', '8789', '6969', '6885', 'T', 'W', 'r', '5631', 'Y', 'A', 'I', 'z', 'b', 'T', '3131', '5301', '7751', '763', '5767']