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.

3, 14, ['D', 'Q', 'W', '3925', '7569', '2455', '9499', 'A', '3205', '9459', 't', '9053', 'q', 'T']
45165

3, 10, ['r', 'A', 'l', '7169', '3249', 'T', 'O', 'g', 'F', 'M', 'R', '171', 'M', '2449', '3749', 'f']
10418

11, 22, ['o', '2043', '8977', 'Y', 'A', 'q', '137', '305', '6793', '3199', 'X', 'W', '5175', 'V', '569', 'P', 'Q', 'O', '8221', '7235', '9537', '8235', '2127']

38972