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]: 1, 1, ['7479', 'q', 'F', '5725', '7697', '6653', '275', 'l', '7349', 'c']
[EX A]: 7479

[EX Q]: 16, 22, ['F', '197', '9799', 'W', '9967', 'V', '9955', '5143', 't', 'f', '749', 'N', 'b', '8049', 'W', '6835', '8007', 'm', '7233', 'B', 'I', '599', '6101', 'G', 'i', '2271', 'h', 'P']
[EX A]: 22674

[EX Q]: 3, 6, ['L', 'W', '9663', '7069', 'D', 'B', '6963', 'J', 'U', 'O', 's']
[EX A]:
16732