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]: 13, 14, ['5297', 'V', '7495', '6967', 'b', 'w', 'a', '2403', 'V', 'n', '525', 'd', 'o', 'm', '3439', '4245', '6381', '5743', 'P', '1047']
[EX A]: 0

[EX Q]: 8, 9, ['6753', 'Y', 'v', '1365', '1033', 'l', 'A', '203', 'J', '8391', 'i', '1813', 'V', 'D', 'S', '4981', 'o']
[EX A]: 203

[EX Q]: 13, 14, ['N', 'W', '8947', '5129', 'T', '717', 'o', '4983', 'B', 'J', '607', '8107', 'D', '5565', 'I', '9893', '939', '2009', '8305', '1231', 'A', '8995', '8281', '2653', '7767', 'v', '5367']
[EX A]:
5565