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]: 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]: 3, 20, ['u', '5631', '6297', 's', '5839', 'l', '6967', '4097', '4643', '9645', 'q', 'i', '2963', 'R', '9539', 'j', 'M', '5607', '2651', '907', 'z', 'C', 'O']
[EX A]: 59155

[EX Q]: 8, 29, ['S', '1801', '621', 'm', '3979', '1269', 'y', '1309', 'R', 'O', '2443', '4681', '8915', '5611', '6293', '6365', '3805', 'J', 'd', '9281', '9461', '2613', 'V', 't', '2507', 'y', 'x', '2717', '3399']
[EX A]:
69400