#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
using namespace std;
int main() {
    string first = "Mitya";
    int n , k , d1, d2, m1 , m2 , kek;
    cin >> n >> k >> d1 >> d2 >> m1 >> m2;
    vector<int>v(n,0);
    for(int i = 0 ; i < n; i++){
        if (i >= d1 - 1 && i <= d2 - 1){
            v[i] = 1;
        }
        if ( i >= m1 -1 && i <= m2 - 1){
            v[i] = 2;
        }
    }
    for(int i = 0 ; i < k;i++){
        cout<<(n-i-1)/k+1<<endl;
        if(((n - 1 - i)/k+1) % 2 == 0){
            cout<<"d - "<<(d2-d1-i )/k<<"  m - "<<(m2-m1-i)/k;
            kek = (n-i-1)/k+1 - (d2-d1-(k-(d1 - i - 2)%k) )/k - (m2-m1-(k-(m1 - i -2)%k) )/k ;
            cout <<i<<' '<< kek << endl;


        }
    }
    cout<<endl;
    return 0;
}