#include <bits/stdc++.h>
using namespace std;
int chh;
long long n, k;
long long a[55];
void gao(long long p, long long n, long long k) {
  if (n == 0) return;
  if (n == 1) {
    cout << p;
    return;
  }
  if (k > a[n - 1]) {
    cout << p + 1 << ' ' << p << ' ';
    gao(p + 2, n - 2, k - (a[n - 1]));
  } else {
    cout << p << ' ';
    gao(p + 1, n - 1, k);
  }
}
int main() {
  a[1] = 1, a[2] = 2, a[3] = 3, a[4] = 5;
  for (int i = 5; i <= 50; i++) a[i] = a[i - 2] + a[i - 1];
  while (cin >> n >> k) {
    if (n == 1) {
      puts("1");
      continue;
    }
    gao(1, n, k);
    puts("");
  }
  return 0;
}
