#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; //#define int long long typedef long long ll; typedef unsigned long long ul; typedef unsigned int ui; const ll mod = 1000000009; const ll INF = mod * mod; typedef pair P; #define stop char nyaa;cin>>nyaa; #define rep(i,n) for(int i=0;i=0;i--) #define Rep(i,sta,n) for(int i=sta;i=1;i--) #define Rep1(i,sta,n) for(int i=sta;i<=n;i++) typedef pair LP; typedef vector vec; typedef vector svec; typedef long double ld; typedef pair LDP; const ld eps = 1e-5; void solve() { int n; cin >> n; int a, b; cin >> a >> b; if (n == 1) { cout << "0 0" << endl; return; } int chk = 0; for (int i = 2; i <= n; i++) { if (i*(i - 1) / 2 > a) { chk = i - 1; break; } } vector

ans; int r = a - (chk*(chk - 1) / 2); rep(i, chk-r) { ans.push_back({ 0,0 }); } rep(i, r) { ans.push_back({ 9,0 }); } ans.push_back({ 18,0 }); int sum = a + (chk - r); int rest = b - sum; if (rest == 0) { int cur = 100000; while (ans.size() < n) { ans.push_back({ 100000,cur }); cur -= 50; } rep(i, n) { cout << ans[i].first << " " << ans[i].second << endl; } return; } int chk2 = 0; for (int i = 2; i <= n; i++) { if (i*(i - 1) / 2 > rest) { chk2 = i-1; break; } } int rr = rest - chk2 * (chk2 - 1) / 2; int x = rest - rr; int y = rr; rep(i, x) { ans.push_back({ 0,50 }); } rep(i, y) { ans.push_back({ 18,50 }); } ans.push_back({ 36,50 }); int cur = 100000; while (ans.size() < n) { ans.push_back({ 100000,cur }); cur -= 50; } rep(i, n) { cout << ans[i].first << " " << ans[i].second << endl; } } signed main() { ios::sync_with_stdio(false); cin.tie(0); //cout << fixed << setprecision(5); //init(); solve(); //cout << "finish" << endl; //stop return 0; }