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, 3, ['7641', '5147', '995', 's', '6697']
[EX A]: 13783

[EX Q]: 11, 20, ['8031', 'v', 'p', '4015', 'v', '3299', '4143', '445', 'I', 'L', 'm', 'u', '7963', '8085', 'c', 'k', 'I', 'A', '8433', '1897', 'g', 'x', '5935', '5195', 'W', 'j', 'A']
[EX A]: 26378

[EX Q]: 4, 14, ['q', 'n', 'L', '5847', '5053', '5589', '5023', '8451', '1995', '7469', '2265', 'q', 'V', '2475', 'B', '4003', '2031', 'x', '1177', '2301', 'R', 'L', 'Z', '4903', '4445', '5967', 'Y', 'G']
[EX A]:
44167