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.
12, 13, ['T', '7737', '1841', 'k', '3525', '7449', '1969', '6763', 'o', 'V', '7653', '863', 'q', 'Y', 'm', '3003', 'l', '49', 'D', '5017', 'u', '3629']