/****************************************
* File Name: 226a.cpp
* Author: sky0917
* Created Time: 2014年01月24日 23:33:21
****************************************/
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 100005;int v[maxn];
int main(){int n, m;int a, b, c;int x;while (scanf("%d %d",&n,&x)!=EOF){int ma = 0;int re = 0;for (int i=0; i<n; i++){scanf("%d",&v[i]);}       for (int i=1; i<n; i++){if (v[i-1] - v[i] > re){re = v[i-1] - v[i];}}printf("%d\n",max(0, re-x));}   return 0;
}

/****************************************
* File Name: 226b.cpp
* Author: sky0917
* Created Time: 2014年01月24日 23:33:26
****************************************/
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 5005;char s[maxn];int main(){while (scanf("%s",&s)!=EOF){long long res = 0;long long len = strlen(s);long long cnt = 0;for (long long i=0; i<len-3; i++){if (s[i]=='b' && s[i+1]=='e' && s[i+2]=='a' && s[i+3]=='r'){long long l = i-cnt+1;long long r = len - i - 3;res += l * r;cnt = i+1;}   }printf("%I64d\n",res);}return 0;
}

/****************************************
* File Name: 226c.cpp
* Author: sky0917
* Created Time: 2014年01月24日 23:33:45
****************************************/
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 1000005;int ma;
int v[maxn*10];int vis[10003];
int p[10004];
int tp;
void print(){tp = 0;for (int i=2; i<10000; i++){if (!vis[i]){p[tp++] = i;for (int j=i*2; j<10000; j+=i){vis[j] = 1;}   }}
}
void cal(int x){for (int i=0; p[i]*p[i] <= x && i<tp; i++){if (x % p[i] == 0){v[p[i]]++;while (x % p[i] == 0){x /= p[i];          }   }   }if (x != 1){v[x]++;}
}int val[maxn];
int sum[maxn*10];
int main(){int n, m;int va;print();    while (scanf("%d",&n)!=EOF){ma = 0;for (int i=0; i<n; i++){scanf("%d",&val[i]);if (val[i] > ma)ma = val[i];}for (int i=0; i<n; i++){cal(val[i]);    }   for (int i=1; i<=ma; i++){sum[i] = sum[i-1] + v[i];}scanf("%d",&m);int l, r;while (m--){scanf("%d %d",&l, &r);if (l > ma){printf("0\n");continue;}r = min(ma, r);printf("%d\n",sum[r]-sum[l-1]); }}   return 0;
}

/****************************************
* File Name: 226d.cpp
* Author: sky0917
* Created Time: 2014年01月25日  0:50:46
****************************************/
#include <map>
#include <cmath>
#include <queue>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const double p = acos(-1.0);
double dp[1<<21];
int n;
double l, r;
struct node{double x, y, di;
}q[22];int main(){while (scanf("%d %lf %lf",&n,&l,&r)!=EOF){for (int i=0; i<n; i++){scanf("%lf %lf %lf",&q[i].x,&q[i].y,&q[i].di);}int st = 1<<n;for (int i=0; i<st; i++){dp[i] = -9999999.0;}   dp[0] = l;for (int i=0; i<st; i++){for (int j=0; j<n; j++){if (((1<<j)&i) == 0){int sta = i | (1<<j);   double x = dp[i] - q[j].x;double y = -q[j].y;double a = x*cos(p*q[j].di/180)-y*sin(p*q[j].di/180);double b = x*sin(p*q[j].di/180)+y*cos(p*q[j].di/180);if (b >= 0){dp[sta] = r;continue;}double tmp = y*a/b+q[j].x;dp[sta] = max(dp[sta], tmp);}}}printf("%.10lf\n",min(r, dp[st-1])-l);}   return 0;
}