#include <bits/stdc++.h>
using namespace std;
const int N = 55;
int main() {
  int n;
  long long k;
  cin >> n >> k;
  long long fib[N];
  fib[n] = fib[n - 1] = 1;
  for (int i = n - 2; i >= 0; --i) fib[i] = fib[i + 1] + fib[i + 2];
  int a[N];
  for (int i = 0; i < n; ++i) a[i] = i + 1;
  for (int i = 0; i < n - 1; ++i) {
    if (fib[i + 1] < k) {
      swap(a[i], a[i + 1]);
      k -= fib[i + 1];
      ++i;
    }
  }
  for (int i = 0; i < n; ++i) cout << a[i] << ' ';
}
