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.
6, 13, ['5175', 'x', '9921', '5505', '7571', 'V', 'f', 'p', '7749', '4875', 'j', 'l', '7569', '9017', '57', 'd', 'j', '5653', 'Z', '8663', '3635', 'd', '3873', 'J', 'Z', '9125', '3335', 'x', 'a']