#include<cstdio>
#include<iostream>
#include<algorithm>
#define N 100001
using namespace std;
typedef long long LL;
LL sum[N],p[N],suf[N];
int pos[N];
void read(LL &x)
{x=0; char c=getchar();while(!isdigit(c)) c=getchar();while(isdigit(c)) { x=x*10+c-'0'; c=getchar(); }
}
int main()
{freopen("max.in","r",stdin);freopen("max.out","w",stdout);int n,k;scanf("%d%d",&n,&k);for(int i=1;i<=n;i++) read(sum[i]),sum[i]+=sum[i-1];for(int i=1;i+k-1<=n;i++) p[i]=sum[i+k-1]-sum[i-1];for(int i=n-k+1;i;i--) if(p[i]>=suf[i+1]) suf[i]=p[i],pos[i]=i;else suf[i]=suf[i+1],pos[i]=pos[i+1];int ansx,ansy;LL maxn=0;for(int i=1;i+k+k-1<=n;i++)if(p[i]+suf[i+k]>maxn) maxn=p[i]+suf[i+k],ansx=i,ansy=pos[i+k];else if(p[i]+suf[i+k]==maxn && ansy>pos[i+k]) ansy=pos[i+k];printf("%d %d",ansx,ansy);return 0;
}

#include<map>
#include<cstdio>
#include<cstring>
#include<iostream>
using namespace std;
typedef long long LL;
LL dp[5][1001];
int cost[5][5001],n;
int C[5001],D[5001],A[5001],B[5001];
int sum[200000001];
inline void read(int &x)
{x=0; char c=getchar();while(!isdigit(c)) c=getchar();while(isdigit(c)) { x=x*10+c-'0'; c=getchar(); }
}
void init()
{read(n); read(cost[1][0]); read(cost[2][0]); read(cost[3][0]); read(cost[4][0]);for(int i=1;i<=cost[1][0];i++) read(cost[1][i]);for(int i=1;i<=cost[2][0];i++) read(cost[2][i]);for(int i=1;i<=cost[3][0];i++) read(cost[3][i]);for(int i=1;i<=cost[4][0];i++) read(cost[4][i]);
}
void out(LL x)
{if(x/10) out(x/10);putchar(x%10+'0');
}
void work1()
{for(int i=0;i<=n;i++) dp[0][i]=1;for(int k=1;k<=4;k++)for(int i=1;i<=n;i++)for(int j=1;j<=cost[k][0];j++)if(i-cost[k][j]>=0) dp[k][i]+=dp[k-1][i-cost[k][j]];out(dp[4][n]);
}
void work2()
{int ans=0;for(int i=1;i<=cost[1][0];i++)for(int j=1;j<=cost[2][0];j++)for(int k=1;k<=cost[3][0];k++)for(int l=1;l<=cost[4][0];l++)if(cost[1][i]+cost[2][j]+cost[3][k]+cost[4][l]<=n) ans++;printf("%d",ans);
}
void work3()
{int cnt=0,sc=cost[3][0],sd=cost[4][0]; for(int i=1;i<=sc;i++) C[i]=cost[3][i];for(int i=1;i<=sd;i++) D[i]=cost[4][i]; int minn=2e8,maxn=0 ;for(int i=1;i<=sc;i++)for(int j=1;j<=sd;j++){sum[C[i]+D[j]]++;minn=min(minn,C[i]+D[j]);maxn=max(maxn,C[i]+D[j]); }for(int i=minn;i<=maxn;i++) sum[i]+=sum[i-1];int sa=cost[1][0],sb=cost[2][0]; for(int i=1;i<=sa;i++) A[i]=cost[1][i];for(int i=1;i<=sb;i++) B[i]=cost[2][i];long long ans=0; for(int i=1;i<=sa;i++)for(int j=1;j<=sb;j++)if(n-A[i]-B[j]>=0) ans+=sum[min(n-A[i]-B[j],maxn)];out(ans);
}
int main()
{freopen("eat.in","r",stdin);freopen("eat.out","w",stdout); init();if(cost[1][0]<=50 && cost[2][0]<=50 && cost[3][0]<=50 && cost[4][0]<=50) work2();else if(n<=1000) work1();else work3(); return 0;
}

#include<cstdio>
#include<cstring>#define N 10003using namespace std;const int mod=12345647;char s[N];
int a[N],b[N],dp[N][3][2][2][2];void ADD(int &i,int j)  {  i+=j; if(i>=mod) i-=mod; }int main()
{freopen("candy.in","r",stdin);freopen("candy.out","w",stdout);scanf("%s",s+1); int len1=strlen(s+1);for(int i=1;i<=len1;++i) a[i]=s[i]-'0';scanf("%s",s+1); int len2=strlen(s+1);for(int i=1;i<=len2;++i) b[i+len1-len2]=s[i]-'0';dp[0][0][0][0][0]=1;int i,j,k,l,t,I,J,K,L,T;for(i=0;i<len1;i++)for(j=0;j<3;j++)for(k=0;k<2;k++)for(l=0;l<2;l++)for(t=0;t<2;t++)if(dp[i][j][k][l][t])for(int s1=0;s1<=9;s1++)if(s1!=3)for(int s2=0;s2<=9;s2++)if(s2!=3)for(int s3=0;s3<=9;s3++)if(s3!=3){I=i+1;J=j*10+a[i+1]-s1-s2-s3;if(J<0 || J>2) continue;if(!k && s1<b[i+1]) continue;K=(k || s1>b[i+1]);if(!l && s2<b[i+1]) continue;L=(l || s2>b[i+1]);if(!t && s3<b[i+1]) continue;T=(t || s3>b[i+1]);ADD(dp[I][J][K][L][T],dp[i][j][k][l][t]);                    }int ans=0;for(k=0;k<2;k++)for(l=0;l<2;l++)for(t=0;t<2;t++)ADD(ans,dp[len1][0][k][l][t]);printf("%d",ans);
}

#include<cstdio>
using namespace std;
bool check(int k)
{while(k){if(k%10==3) return false;k/=10;}return true;
}
int main()
{freopen("candy.in","r",stdin);freopen("candy.out","w",stdout);int n,k,ans=0;scanf("%d%d",&n,&k);for(int i=k;i+k+k<=n;i++)if(check(i))for(int j=k;j+i+k<=n;j++)if(check(j)&&check(n-i-j)) ans++;printf("%d",ans);return 0;
}