#include <bits/stdc++.h>
using namespace std;
const int N = 4005;
const long long MOD = 1e9 + 7;
const long long M = 1e18;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  int tt = 1;
  while (tt--) {
    long long n, k;
    cin >> n >> k;
    long long fib[n + 1];
    fib[0] = fib[1] = 1;
    for (int i = 2; i <= n; i++) fib[i] = fib[i - 1] + fib[i - 2];
    int val[n], idx = 0;
    while (idx < n) {
      if (k <= fib[n - 1 - idx]) {
        val[idx] = idx + 1;
        idx++;
      } else {
        k -= fib[n - 1 - idx];
        val[idx] = idx + 2;
        val[idx + 1] = idx + 1;
        idx += 2;
      }
    }
    for (int i = 0; i < n; i++) cout << val[i] << " ";
  }
  return 0;
}
