#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int N, T;

class WorstMayor {
  public:
    void load_data() {
      cin >> N >> T;
    }

    void run() {
      load_data();

      for (int t = 0; t < T; ++t) {
        cout << 3 << endl;
      }
    }
};

int main() {
  WorstMayor wm;
  wm.run();

  return 0;
}