#include <bits/stdc++.h>
using namespace std;
const int INF = 1 << 29;
int dp[100][2][100];
struct UnionFind {
  vector<int> parent;
  UnionFind(int N) : parent(N) {
    for (int i = 0; i < (int)(N); i++) parent[i] = i;
  }
  int getRoot(int child) {
    return ((parent[child] == child) ? child
                                     : parent[child] = getRoot(parent[child]));
  }
  void unite(int x, int y) {
    int root_x = getRoot(x);
    int root_y = getRoot(y);
    if (root_x == root_y) return;
    parent[root_x] = parent[root_y];
  }
  bool isSame(int x, int y) { return getRoot(x) == getRoot(y); }
};
int main() {
  int N, K, S;
  cin >> N >> K >> S;
  cout << "3 3 1 1";
}
