Idea: fastCN

Given a node count `-n`, submit an interactive job of size `-n` for the longest amount of walltime available in backfill.

Given a time constraint `-W`, submit an interactive job for the largest size job available in backfill that can run for `-W`.