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]: 6, 8, ['s', 'X', 'a', 'L', 'N', 'J', '1893', '4909', '349', '7679', '4479', 'i', '7345']
[EX A]: 6802

[EX Q]: 2, 3, ['9191', 'D', '1937', 'N', 'g', '3485', '7327']
[EX A]: 1937

[EX Q]: 1, 2, ['W', '4963', '3295', '4703', 'Q', '2493', 'p', '1995', 'U', '5221', 'P', 'V', 'x', 'c', 'X', 'o', 'z', 'o', '6135', '49', '6339', '967', '549', 'J', 'x']
[EX A]:
4963