#include <bits/stdc++.h>
using namespace std;
const int MAXN = 10000;
long long f[MAXN];
int main() {
  ios::sync_with_stdio(false);
  f[0] = 1;
  f[1] = 1;
  int fi = 1;
  while (f[fi - 1] <= f[fi]) {
    fi++;
    f[fi] = f[fi - 1] + f[fi - 2];
  }
  long long n, m;
  cin >> n >> m;
  long long ans[50];
  for (long long i = 0; i < n; i++) ans[i] = n - i;
  while (1 < m) {
    for (long long i = 0; i <= 50; i++) {
      if (f[i] <= m && m <= f[i + 1]) {
        m -= f[i];
        long long tmp = ans[i - 1];
        ans[i - 1] = ans[i];
        ans[i] = tmp;
      }
    }
  }
  for (int i = n - 1; 0 <= i; i--) cout << ans[i] << ' ';
}
