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.
17, 20, ['M', '8533', 'k', '9805', '7805', '4715', '9347', 'S', '9449', '1795', 'd', 'Y', '6813', 'g', '4035', 'b', 'Z', 'N', 'Q', '7547', '577', 'y', 'n', 'C', 'u']