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.
2, 4, ['7561', '8209', '9221', 'q', '1929', '2593', 'A', '737', 'w', '8549', 'F', 'Y', 'w', 'k', 'I', '17', '7007', 'p', 't', '9313', '2445']