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, 19, ['4381', 'n', '5913', '6073', 'g', '7689', '3473', 'v', 'a', '4389', '5527', 'g', 'n', '8607', 'u', '9097', '6207', '5919', '5703', '557', '9725', 'E', 't', '1247']