#include <bits/stdc++.h>
using namespace std;
int n;
long long k;
long long cnt[60];
int main() {
  cin >> n >> k;
  cnt[0] = 1;
  cnt[1] = 1;
  for (int i = 2; i <= n; i++) cnt[i] = cnt[i - 1] + cnt[i - 2];
  vector<int> p;
  int i = n;
  int cur = 1;
  while (p.size() < n) {
    assert(k <= cnt[i]);
    if (k > cnt[i - 1]) {
      k -= cnt[i - 1];
      p.push_back(cur + 1);
      p.push_back(cur);
      i -= 2;
      cur += 2;
    } else {
      p.push_back(cur);
      i -= 1;
      cur += 1;
    }
  }
  assert(p.size() == n);
  for (int a : p) cout << a << " ";
  cout << endl;
}
