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, 2, ['4319', '3495']
[EX A]: 7814

[EX Q]: 8, 12, ['v', 'N', '8123', '1677', '5743', '8657', 'S', '5073', 'Y', 'R', '2781', '6583', 'A', '1989', 'S', '9301', 'y', 'j', '1759', 'U', '9951', 'W', '5967', 'a', 'c']
[EX A]: 14437

[EX Q]: 17, 23, ['I', 'w', 'Q', 'P', '6893', 'i', 'I', '599', '4593', '3979', 'y', 'u', 'Y', 'q', '9981', '343', '8399', 'q', '4331', 'q', 'q', '6189', 'P', '2283', '5041', '6683', '7389', '865', 'S', 'x']
[EX A]:
18919