#include<bits/stdc++.h>
#define LL long long
#define rep(i,s,t) for(register int i = (s),i##end = (t); i <= i##end; ++i)
#define dwn(i,s,t) for(register int i = (s),i##end = (t); i >= i##end; --i)
using namespace std;
inline int read()
{int x=0,f=1;char ch;for(ch=getchar();!isdigit(ch);ch=getchar())if(ch=='-')f=-f;for(;isdigit(ch);ch=getchar())x=10*x+ch-'0';return x*f;
}
int main()
{int k = read();int d = 1999 - k % 1999;int S = (k + d) / 1999;cout << 2000 << endl;rep(i, 1, 1998) cout << 0 << " ";cout << -d << " ";cout << S + d << endl;
}

#include<bits/stdc++.h>
#define LL long long
#define rep(i, s, t) for(register int i = s, i##end = t; i <= i##end; ++i)
#define dwn(i, s, t) for(register int i = s, i##end = t; i >= i##end; --i)
using namespace std;
inline int read()
{int x = 0, f = 1; char ch = getchar();for(;!isdigit(ch);ch=getchar())if(ch == '-')f = -f;for(;isdigit(ch);ch=getchar())x = 10 * x + ch - '0';return x * f;
}
const int mod = 998244353,maxn = 1e5 + 10;
int n,k;
int a[maxn], b[maxn], nx[maxn], cur[maxn], f[maxn], bl[maxn];
inline void inc(int &x, int y) {x += y; if(x >= mod) x -= mod;}
struct block
{int l, r, sum, sumf[700], sz;void calsum(){memset(sumf, 0, sizeof(sumf));int cur = 0;dwn(i, r, l){cur += b[i];inc(sumf[sz + cur], f[i - 1]);}rep(i, 1, sz + sz) inc(sumf[i], sumf[i - 1]);}int query(int pos){if(pos + sz < 0)return 0;return sumf[min(pos + sz, sz + sz)];}
}bs[350];inline void update(int pos, int val)
{f[pos] = val;bs[bl[pos + 1]].calsum();
}int query(int x)
{int ans = bs[bl[x]].query(k), cursum = bs[bl[x]].sum;dwn(i, bl[x]-1, 1){inc(ans, bs[i].query(k - cursum));cursum += bs[i].sum;}return ans;
}int main()
{n = read(), k = read();rep(i, 1, n) a[i] = read();rep(i, 1, n) nx[i] = cur[a[i]], cur[a[i]] = i;f[0] = 1; int kk = sqrt(n);rep(i, 1, n) bl[i] = (i - 1) / kk + 1;rep(i, 1, bl[n]){bs[i].r = min(i * kk, n);bs[i].l = bs[i-1].r + 1;bs[i].sz = bs[i].r - bs[i].l + 1;}bs[1].calsum();rep(i, 1, n){if(nx[nx[i]]){int pos = nx[nx[i]]; b[pos]++;bs[bl[pos]].sum++; bs[bl[pos]].calsum();}if(nx[i]){int pos = nx[i]; b[pos] -= 2;bs[bl[pos]].sum -= 2; bs[bl[pos]].calsum();}b[i]++; bs[bl[i]].sum++; bs[bl[i]].calsum();update(i, (f[i] = query(i)));}cout << f[n] << endl;
}

#include<bits/stdc++.h>
#define LL long long
#define rep(i,s,t) for(register int i = (s),i##end = (t); i <= i##end; ++i)
#define dwn(i,s,t) for(register int i = (s),i##end = (t); i >= i##end; --i)
using namespace std;
inline int read() {int x=0,f=1;char ch;for(ch=getchar();!isdigit(ch);ch=getchar())if(ch=='-')f=-f;for(;isdigit(ch);ch=getchar())x=10*x+ch-'0';return x*f;
}
int query(vector<int> s, vector<int> t, int node) {cout << s.size() << endl;for(int i = 0; i < (int)s.size(); ++i) {if(i != 0)putchar(' ');cout << s[i] + 1;}cout << endl;cout << t.size() << endl;for(int i = 0; i < (int)t.size(); ++i) {if(i != 0)putchar(' ');cout << t[i] + 1;}cout << endl;cout << node + 1 << endl;return read();
}
vector<int> nd, size, p;
vector<pair<int, int>> ans;
set<int> X;
int main() {int n;cin >> n;for (int i = 1; i < n; ++i) nd.push_back(i);p.resize(n);for (int i = 0; i < n; ++i) p[i] = i;size.resize(n);size[0] = n;for (int i = 1; i < n; ++i) size[i] = query({ 0 }, nd, i);sort(p.begin(), p.end(), [](int x, int y) { return size[x] < size[y]; });for (auto node : p) {if (size[node] != 1) {while (!X.empty()) {vector<int> cur(X.begin(), X.end());if (!query({ 0 }, cur, node)) break;int l = 0, r = (int)cur.size();while (l + 1 < r) {int mid = l + r >> 1;if (query({ 0 }, vector<int>(cur.begin() + l, cur.begin() + mid), node)) r = mid;else l = mid;}ans.emplace_back(node, cur[l]);X.erase(cur[l]);}}X.insert(node);}cout << "ANSWER" << endl;for (auto p : ans) cout << p.first + 1 << " " << p.second + 1 << endl;return 0;
}