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]: 2, 3, ['9191', 'D', '1937', 'N', 'g', '3485', '7327']
[EX A]: 1937

[EX Q]: 3, 18, ['h', 'x', '371', 'i', '8545', '7767', '5033', '1041', 'A', '4643', 'L', '187', '5017', 'x', 'R', '7891', '3919', '9721', '8625', '5817', 'D', '4825', 'S']
[EX A]: 54135

[EX Q]: 5, 7, ['q', '6803', 'P', 'P', 'Y', '3383', 'S', 'y', '1615', 'R', '2387', '4423', '1499', 'h', 'y', '8237', '9311']
[EX A]:
3383