#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N = 1e6+10;

ll a[N];

int main()
{
    ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int n,k,ri,rj;
    cin>>n>>k;
    for(int i=1;i<=n;i++)cin>>a[i];
    cin>>ri>>rj;
    if(rj<k){
        cout<<ri<<" "<<rj;
        return 0;
    }
    ll over=rj-k+1;
    for(int i=ri+1;i<=n;i++){
        if(a[i]<k){
            if(over>k-1-a[i])over-=k-1-a[i];
            else {
                cout<<i<<" "<<a[i]+over;
                return 0;
            }
        }else{
            over+=a[i]-k+1;
        }
    }
    int ansx=n+over/(k-1);
    if(over%(k-1)!=0)ansx++;
    int ansy=over%(k-1);
    if(over%(k-1)==0)ansy=k-1;

    cout<<ansx<<" "<<ansy;

    return 0;
}