#include <bits/stdc++.h>
using namespace std;
int main() {
  long long int n, k;
  cin >> n >> k;
  int N = n;
  vector<long long int> fib(n + 1);
  fib[0] = 1;
  fib[1] = 1;
  for (int i = 2; i <= n; i++) {
    fib[i] = fib[i - 1] + fib[i - 2];
  }
  while ((k > 0) && (n > 0)) {
    if (fib[n - 1] < k) {
      k = k - fib[n - 1];
      cout << N + 2 - n << " " << N + 1 - n << " ";
      n = n - 2;
    } else {
      cout << N + 1 - n << " ";
      n = n - 1;
    }
  }
  return 0;
}
