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, 4, ['3155', '581', 'N', '153', 't', '7941', '6065']
[EX A]: 734

[EX Q]: 3, 13, ['7259', '131', '4039', 'b', '9015', '9573', '8473', 'O', 's', '6851', 'N', 'E', '715', 'k', 'j', 'r', '9679', '9519', '5335', '383', 'A', 'd']
[EX A]: 38666

[EX Q]: 14, 28, ['3067', 'O', 'g', 'L', '2971', 'G', '4489', '7477', 'W', 'p', 'f', '7387', 'p', '8291', '9975', '313', '5195', 'a', 'K', 'F', '5755', 'p', 'v', 'N', 'Q', '7053', 'd', 'Z', '5481', 'P']
[EX A]:
36582