#include <bits/stdc++.h>
using namespace std;
long long mval = 3000000000;
long long mod = 1e9 + 7;
double eps = 1e-10;
long long powmod(long long a, long long b) {
  long long res = 1;
  while (b > 0) {
    if (b & 1) res = (res * a) % mod;
    a = (a * a) % mod;
    b /= 2;
  }
  return res;
}
long long minverse(long long a) {
  if (a == 0)
    return 1LL;
  else
    return powmod(a, mod - 2);
}
long long fib[1002];
int main() {
  int t, n, i, j;
  long long k;
  fib[1] = 1;
  fib[2] = 2;
  for (i = 3; i <= 50; ++i) fib[i] = fib[i - 1] + fib[i - 2];
  vector<int> ans;
  cin >> n >> k;
  if (n == 1)
    ans.push_back(1);
  else {
    for (i = n; i >= 1; --i) {
      if (i == n) {
        if (k > fib[i - 1]) {
          k -= fib[i - 1];
          ans.push_back(2);
        } else
          ans.push_back(1);
      } else if (i == 1) {
        int last = ans[ans.size() - 1];
        if (last == n)
          ans.push_back(n - 1);
        else
          ans.push_back(n);
      } else {
        int last = ans[ans.size() - 1];
        if (last == (ans.size() + 1))
          ans.push_back(last - 1);
        else {
          if (k > fib[i - 1]) {
            k -= fib[i - 1];
            ans.push_back(ans.size() + 2);
          } else
            ans.push_back(ans.size() + 1);
        }
      }
    }
  }
  for (i = 0; i < ans.size(); ++i) cout << ans[i] << " ";
}
