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