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]: 2, 9, ['i', 'C', '833', '1739', 'M', '2417', '5807', '2287', '9765', '3661', '9095', 'j', '1943', '2905', 'F', 'C', '4941', '117', 'G', 'j', '8567', 'I']
[EX A]: 22848

[EX Q]: 5, 18, ['T', '7117', '7067', 't', '7083', '5711', '6735', 's', '4879', '2553', 'a', 'z', 'Q', '4759', '6243', 'k', 'V', '7803', '2489', 'j', '9449', '8017', '9739', 'F', '1557']
[EX A]: 45766

[EX Q]: 14, 26, ['9967', 'V', '7137', '9493', '6701', '3561', 'v', 'F', '5163', '1905', 'w', '4573', '8641', 's', 'E', '8525', '2041', '2423', '4903', 'E', 'N', '5133', 'Y', '5245', 'E', 'R']
[EX A]:
28270