#include <bits/stdc++.h>
using namespace std;
const int INF = 1011110000, MOD = 1000000007;
int n;
long long k, f[55];
void input() { cin >> n >> k; }
void solve() {
  for (int i = 1, c = 1; i <= n;) {
    if (f[n - i] < k) {
      printf("%d %d ", i + 1, i);
      k -= f[n - i];
      i += 2;
    } else {
      printf("%d ", i);
      i++;
    }
  }
}
int main() {
  f[1] = f[0] = 1;
  for (int i = 2; i < 55; i++) f[i] = f[i - 1] + f[i - 2];
  int t = 1;
  while (t--) {
    input();
    solve();
  }
}
