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.

[EX Q]: 4, 7, ['3291', 'e', 'm', 'E', 'e', '3201', 'E', 'c', '2355', '6491']
[EX A]: 3201

[EX Q]: 2, 6, ['m', 'q', '4069', '4487', 'c', '4639']
[EX A]: 13195

[EX Q]: 11, 17, ['H', 'W', 'M', '2653', 'C', 'H', 'V', 'Y', 'S', '5761', '6283', 'P', '7191', 'I', 'G', '3419', '4305']
[EX A]:
21198