instruction:
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.
question:
10, 14, ['u', 'o', 'V', '8223', '365', 'u', '8971', '4209', 'E', 'I', '3385', '5521', '1329', 'b', 'C', '5707', '1807', '2859', '7443', '8141', 'u', '6269', '5781', 'T', 'N', 'R', 'C']
answer:
10235


question:
2, 4, ['L', '8053', '8121', 'J', 'H', '7591', 'U', 'm']
answer:
16174


question:
9, 13, ['3063', 'L', 'd', 'l', '9957', '5011', '9747', 't', '3981', '5245', 'j', 'n', '8117', 'U']
answer:

17343