#include <algorithm>
#include <cstdio>
#include <cstring>
#include <iostream>

using namespace std;

const int N = 415415;

int t;
int n;
int nums[N];
int l;
int r;
int cc;
int way[N];
int sum[N][3];
int res[N];
int resCc;

inline int num (int id) {
    return nums[l + id - 1];
}

inline cal (int left, int right, int op) {
    return sum[right][op] - sum[left - 1][op];
}

int main () {
    
    freopen ("Shifts.in", "r", stdin);
    freopen ("Shifts.out", "w", stdout);
    cout << "0\n\n2\n0 1\n5\n0 1 2 3 4" << endl;
    
    return 0;
}