int n, k, maxVal, minVal;   

int arr[100000], ans = 0, maxLen = 1, red[100000][2];

struct Node {

    int loc, val;

}node;

struct CMP_1 {

    bool operator()(const Node& min, const Node& max) {

         if((min.val > max.val) ||(min.val == max.val && min.loc > max.loc))

            return true;

        return false;

    }

};

struct CMP_2 {

    bool operator()(const Node& min, const Node& max) {

        if((min.val < max.val) || (min.val == max.val && min.loc > max.loc))

            return true;

        return false;

    }

};

int last = 0;

int main() {

    scanf("%d %d", &n, &k);

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

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

    }

    priority_queue<Node, vector<Node>, CMP_1> pri;

    priority_queue<Node, vector<Node>, CMP_2> pri2;



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

        node.val = arr[i];

        node.loc = i;

        pri.push(node);

        pri2.push(node);



        int minVal = pri.top().val;

        int maxVal = pri2.top().val;

        

        while(maxVal - minVal > k) {

            int lt = min(pri.top().loc, pri2.top().loc);

            while(!pri.empty() && pri.top().loc <= lt) {

                pri.pop();

            }

            while(!pri2.empty() && pri2.top().loc <= lt) {

                pri2.pop();

            }

            last = lt + 1;

            minVal = pri.top().val;

            maxVal = pri2.top().val;

        }

        int tmpLen = i - last + 1;

        if(tmpLen == maxLen) {

            red[ans][0] = last;

            red[ans][1] = i;

            ++ans;

        }

        if(tmpLen > maxLen) {

            red[0][0] = last;

            red[0][1] = i;

            ans = 1;

            maxLen = tmpLen;

        }

    }

    printf("%d %d\n", maxLen, ans);

    for(int i = 0; i < ans; ++i) {

        printf("%d %d\n", red[i][0] + 1, red[i][1] + 1);

    }

    return 0;

}