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]: 11, 20, ['7193', 't', 'v', '6817', '3505', 'u', '6051', '4027', 'G', '8381', 'Z', 'T', 'q', 'M', 'o', '7645', '75', 'J', 'U', 'N', '3885', 'y', 'C', 'q', '5109', 'f', 'v']
[EX A]: 7720

[EX Q]: 19, 19, ['4147', '1103', '5749', 'c', '5103', '3491', '4511', '197', 'T', '1601', 'J', 'c', '1309', 'a', '607', 'p', 'C', '9473', '5221', 'D', 'U', 'O', '5013']
[EX A]: 5221

[EX Q]: 3, 12, ['d', 'd', 'h', 'd', 'q', 'q', 'a', 'y', '6399', 'G', 'A', 'n', '1425', 'R', 'y', '563', '8829', '7311', '5419', '1203', '8527', '683', '8147', 'Z', '7511', 'n']
[EX A]:
6399