Language: C++

//****************************2017.10.12*****************************************

/*
#include <iostream>
#include <algorithm>
using namespace std;

const int MAXN = 1e5;
int a[MAXN];

int main(void){
	int n, k, x;
	cin >> n >> k >> x;
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	for(int i = 0; i < k; i++){
		a[i + n] = x;
	}
	sort(a, a + n + k);
	int ans = 0;
	for(int i = 0; i < n; i++){
		ans += a[i];
	}
	cout << ans << endl;
	return 0;
}
*/

/*
#include <iostream>
#include <map>
using namespace std;

const int MAXN = 1e5 + 10;
int a[MAXN];
map<int, int> x, y;
string s;

int main(void){
	int n;
	cin >> n >> s;
	for(int i = 0; i < n; i++){
		a[i + 1] = s[i] - '0';
		if(a[i + 1] == 0) a[i + 1] = -1;
	}
	int ans = 0, sol = 0;
	for(int i = 1; i <= n; i++){
		ans += a[i];
		if(!x[ans]) x[ans] = i;
		if(ans == 0) sol = max(sol, i);
		if(x[ans]) sol = max(sol, i - x[ans]);
	}
	cout << sol << endl;
	return 0;
}
*/

/*
#include <iostream>
using namespace std;

const int MAXN = 1e2 + 10;
int a[MAXN][MAXN], vis[MAXN][MAXN];

int main(void){
	int n, m, k;
	cin >> n >> m >> k;
	for(int i = 1; i <= n; i++){
		for(int j = 1; j <= m; j++){
			cin >> a[i][j];
			vis[j][i] = a[i][j] + vis[j][i - 1];
		}
	}
	// for(int j = 1; j <= m; j++){
	// 	for(int i = 1; i <= n; i++){
	// 		cout << vis[j][i] << " ";
	// 	}
	// 	cout << endl;
	// }
	int sol = 0, ans = 0;
	for(int j = 1; j <= m; j++){
		int cnt = 0;
		int gel = 0;
		int gg = 0;
		for(int i = 1; i <= n; i++){
			if(a[i][j] == 1){
				int cc = min(k, n - i + 1);
				// cnt = max(cnt, vis[j][cc + i - 1] - vis[j][i - 1]);
				if(vis[j][cc + i - 1] - vis[j][i - 1] > cnt){
					cnt = vis[j][cc + i - 1] - vis[j][i - 1];
					gel = gg;
				}
				gg++;
			}
		}
		sol += cnt;
		ans += gel;
	}
	cout << sol << " " << ans << endl;
	return 0;
}
*/

/*
#include <iostream>
#include <queue>
#include <math.h>
using namespace std;

const int MAXN = 1e5 + 10;
int a[MAXN], k, n;
int vis1[MAXN], vis2[MAXN];
struct node{
	int l, r;
};

void solve(int l, int r){
	queue<node> q;
	q.push({l, r});
	while(k && !q.empty()){
		node cnt = q.front();
		q.pop();
		if(cnt.r - cnt.l <= 1) continue;
		int mid = (cnt.l + cnt.r) >> 1;
		for(int i = cnt.l; i < mid; i++){
			int cc = i - cnt.l;
			int t = a[i];
			a[i] = a[mid + cc];
			a[mid + cc] = t;
		}
		q.push({cnt.l, mid});
		q.push({mid, cnt.r});
		k -= 2;
	}
}

int main(void){
	cin >> n >> k;
	if(!(k & 1)){
		cout << -1 << endl;
		return 0;
	}
	for(int i = 0; i < n; i++){
		a[i] = i + 1;
	}
	k--;
	solve(0, n);
	if(k) cout << -1 << endl;
	else{
		for(int i = 0; i < n; i++){
			cout << a[i] << " ";
		}
		cout << endl;
	}
	return 0;
}
*/

/*
#include <iostream>
using namespace std;

int main(void){
	int a, b, c;
	cin >> a >> b >> c;
	cout << (a ^ b ^ c) << endl;
	return 0;
}
*/

/*
#include <iostream>
using namespace std;

const int MAXN = 1e2;
string s[MAXN];

int main(void){
	int n, m;
	cin >> n >> m;
	for(int i = 0; i < n; i++){
		cin >> s[i];
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j < m; j++){
			if(s[i][j] == '#'){
				cout << "#";
				continue;
			}else{
				int cnt = 0;
				if(i - 1 >= 0 && s[i - 1][j] == '#') cnt++;
				if(i + 1 < n && s[i + 1][j] == '#') cnt++;
				if(j - 1 >= 0 && s[i][j - 1] == '#') cnt++;
				if(j + 1 < m && s[i][j + 1] == '#') cnt++;
				if(i - 1 >= 0 && j - 1 >= 0 && s[i - 1][j - 1] == '#') cnt++;
				if(i - 1 >= 0 && j + 1 < m && s[i - 1][j + 1] == '#') cnt++;
				if(i + 1 < n && j - 1 >= 0 && s[i + 1][j - 1] == '#') cnt++;
				if(i + 1 < n && j + 1 < m && s[i + 1][j + 1] == '#') cnt++;
				cout << cnt;
			}
		}
		cout << endl;
	}
	return 0;
}
*/

/*
#include <iostream>
#include <vector>
#include <algorithm>
#include <string.h>
#include <math.h>
#include <queue>
using namespace std;

const int MAXN = 1e3;
vector<int> vt[MAXN];
int vis[MAXN];
int x[MAXN], y[MAXN];
bool flag = false;

void bfs(int x, int pre){
	queue<int> q;
	vis[x] = vis[pre] = 1;
	for(int i = 0; i < vt[x].size(); i++){
		if(vt[x][i] != pre){
			q.push(vt[x][i]);
			vis[vt[x][i]] = 1;
		}
	}
	while(!q.empty()){
		int cnt = q.front();
		q.pop();
		for(int i = 0; i < vt[cnt].size(); i++){
			if(vt[cnt][i] == pre){
				flag = true;
				break;
			}
			if(!vis[vt[cnt][i]]){
				q.push(vt[cnt][i]);
				vis[vt[cnt][i]] = 1;
			}
		}
	}
}

int main(void){
	int n, m;
	cin >> n >> m;
	for(int i = 0; i < m; i++){
		cin >> x[i] >> y[i];
		vt[x[i]].push_back(y[i]);
		vt[y[i]].push_back(x[i]);
	}
	int sol = 0;
	// vis[6] = vis[7] = 1;
	// dfs(6, 7);
	// cout << flag << "//" << endl;
	// if(!flag) sol++;
	for(int i = 0; i < m; i++){
		vis[x[i]] = vis[y[i]] = 1;
		bfs(x[i], y[i]);
		if(!flag) sol++;
		memset(vis, 0, sizeof(vis));
		flag = false;
	}
	cout << sol << endl;
	return 0;
}
*/

#include <iostream>
using namespace std;

const int MAXN = 100;
int x[MAXN], y[MAXN];

int main(void){
	int n, k;
	cin >> n >> k;
	for(int i = 0; i < n; i++){
		cin >> x[i] >> y[i];
	}
	for(int i = 0; i < n; i++){
		for(int j = 0; j < n; j++){
			for(int )
		}
	}
}

Compiler output:
a.cc: In function 'int main()':
a.cc:288:33: error: expected unqualified-id before ')' token
  288 |                         for(int )
      |                                 ^
a.cc:288:32: error: expected ';' before ')' token
  288 |                         for(int )
      |                                ^~
      |                                ;
a.cc:288:33: error: expected primary-expression before ')' token
  288 |                         for(int )
      |                                 ^
a.cc:288:32: error: expected ';' before ')' token
  288 |                         for(int )
      |                                ^~
      |                                ;
a.cc:289:17: error: expected primary-expression before '}' token
  289 |                 }
      |                 ^