#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1e9 + 7;
const long long N = 52;
long long n, value[N], dp[N];
void solve(long long idx, long long k) {
  if (idx >= n) return;
  long long rem = n - 1 - idx;
  if (k <= dp[rem]) {
    value[idx] = idx + 1;
    solve(idx + 1, k);
  } else {
    value[idx] = idx + 2;
    value[idx + 1] = idx + 1;
    solve(idx + 2, k - dp[rem]);
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  long long t, m, l, k, ans, i, j, res = 0, fl;
  t = 1;
  while (t--) {
    cin >> n >> k;
    dp[0] = 1;
    dp[1] = 1;
    for (i = 2; i <= 50; ++i) dp[i] = dp[i - 1] + dp[i - 2];
    solve(0, k);
    for (i = 0; i < n; i++) cout << value[i] << ' ';
    cout << '\n';
  }
  return 0;
}
