#include<cstdio>

#include<cstdlib>

#include<algorithm>

#include<cstring>

#include<cmath>

#define MAXN 500000+10

#define ll long long

#define pii pair<int,int>

#define mp make_pair

using namespace std;

int a[MAXN];

int n,m;

struct Node{

    int pre_dat;

    ll pre_sum;

    int suf_dat;

    ll suf_sum;

    pii dat;

    ll sum;

    ll d;

    Node(int p1=,ll p2=,int p3=,ll p4=,pii p5=mp(,),ll p6=,ll p7=){

        pre_dat=p1,pre_sum=p2,suf_dat=p3,suf_sum=p4,dat=p5,sum=p6,d=p7;

    }

}data[MAXN<<];

Node Merge(Node t1,Node t2){

    if(t1.dat==mp(,))return t2;

    if(t2.dat==mp(,))return t1;

    Node ret;

    ret.d=t1.d+t2.d;

    ret.pre_dat=t1.pre_dat,ret.pre_sum=t1.pre_sum;

    if(ret.pre_sum<t1.d+t2.pre_sum){

        ret.pre_dat=t2.pre_dat,ret.pre_sum=t1.d+t2.pre_sum;

    }

    ret.suf_dat=t2.suf_dat,ret.suf_sum=t2.suf_sum;

    if(ret.suf_sum<=t2.d+t1.suf_sum){

        ret.suf_dat=t1.suf_dat,ret.suf_sum=t2.d+t1.suf_sum;

    }

    ret.dat=t1.dat,ret.sum=t1.sum;

    if(ret.sum<t2.sum){

        ret.dat=t2.dat,ret.sum=t2.sum;

    }

    if(ret.sum<(t1.suf_sum+t2.pre_sum)||ret.sum==(t1.suf_sum+t2.pre_sum)&&ret.dat>mp(t1.suf_dat,t2.pre_dat)){

        ret.dat=mp(t1.suf_dat,t2.pre_dat),

        ret.sum=(t1.suf_sum+t2.pre_sum);

    }

    return ret;

}

void build(int k,int L,int R){

    if(L+==R){

        data[k].pre_dat=data[k].suf_dat=L;

        data[k].dat=mp(L,L);

        data[k].d=data[k].pre_sum=data[k].suf_sum=data[k].sum=a[L];

        return;

    }

    build(k<<,L,(L+R)>>);

    build(k<<|,(L+R)>>,R);

    data[k]=Merge(data[k<<],data[k<<|]);

}

Node query(int a,int b,int k,int L,int R){

    if(b<=L||R<=a){

        return Node(,,,,mp(,),,);

    }

    else if(a<=L&&R<=b){

        return data[k];

    }

    else{

        int mid=((L+R)>>);

        Node lc=query(a,b,k<<,L,mid);

        Node rc=query(a,b,k<<|,mid,R);

        return Merge(lc,rc);

    }

}

void solve(){

    for(int i=;i<=n;i++){

        scanf("%d",&a[i]);

    }

    build(,,n+);

    while(m--){

        int x,y;

        scanf("%d%d",&x,&y);

        Node ans=query(x,y+,,,n+);

        printf("%d %d\n",ans.dat.first,ans.dat.second);

    }

}

int main()

{

//    freopen("data.in","r",stdin);

//    freopen("my.out","w",stdout);

    int T=;

    while(~scanf("%d%d",&n,&m)){

        printf("Case %d:\n",++T);

        solve();

    }

    return ;

}