#include #include #include #include #include #define rep(i, n) for (int i = 0; i < (int)(n); ++i) #define all(v) v.begin(), v.end() using namespace std; using ll = long long; template void chmin(T &a, const T &b) { if (a > b) a = b; } template void chmax(T &a, const T &b) { if (a < b) a = b; } constexpr int N = 100; constexpr int M = 8; class Timer { public: chrono::time_point start; Timer() {} void init() { start = chrono::system_clock::now(); } int get_ms() { auto cur = chrono::system_clock::now(); return chrono::duration_cast(cur - start).count(); } }; struct Coordinate { int x; int y; Coordinate(int x = -1, int y = -1) : x(x), y(y) {} bool operator==(const Coordinate &rhs) const { return x == rhs.x && y == rhs.y; } bool operator!=(const Coordinate &rhs) const { return x != rhs.x || y != rhs.y; } int get_manhattan_dist(const Coordinate &other) const { int dx = abs(x - other.x); int dy = abs(y - other.y); return dx + dy; } int get_euclid_dist_squared(const Coordinate &other) const { int dx = abs(x - other.x); int dy = abs(y - other.y); return dx * dx + dy * dy; } }; struct Planet { int id; Coordinate pos; Planet(int id, Coordinate pos) : id(id), pos(pos) {} }; struct Input { vector planets; Input(vector planets) : planets(planets) {} }; struct Output { int type; int id; Output(int type, int id) : type(type), id(id) {} }; Timer timer; Input read_input() { // Timer timer; timer.init(); int n, m; cin >> n >> m; vector planets; for (int i = 0; i < N; i++) { int a, b; cin >> a >> b; planets.emplace_back(i, Coordinate(a, b)); } Input input(planets); return input; } void solve(const Input &input) { vector outputs; for (int i = 0; i < N; i++) outputs.emplace_back(1, input.planets[i].id + 1); outputs.emplace_back(1, input.planets[0].id + 1); rep(i, M) cout << 0 << " " << 0 << "\n"; cout << outputs.size() << "\n"; for (auto out : outputs) cout << out.type << " " << out.id << "\n"; cerr << "end time: " << timer.get_ms() << "[ms]" << endl; } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Input input = read_input(); solve(input); return 0; }