There is n pillar, their heights are （A1,A2,A3,…An）.you can jump at the top of the pillars. But you will lose abs(a[j]-a[i])*abs(j-i) power when you jump from i-th pillar to j-th pillar. At first you have m power. Can you jump from s-th pillar to e-th pillar.

The input consists of several test cases.

every test case is two integer n（2<=n<200）,q(1=<q<=10000).

The second line contain n integer A1,A2,A3,..An.

The next q line contain there integer s,e,m.

If you can jump from s to e, with less or equal m power output “Yes”, else output “No”