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, 21, ['O', 'q', '4047', 'P', 'T', 'N', 'u', 'F', '9109', '8543', 'X', 'F', '3439', 'I', '5991', '3087', '9843', 'o', '7703', '7593', '6545', 'Y', '2417', 't', '9701']