caN it be acrOnymised? The Typical Way to Make an Acronym Out of a Phrase Is to Take the First Letter of Each Word: TTWMAOPITFLEW. howeveR, sometimEs, you can make an acronym of random leTters In a seNtence such As like this: RETINA. The only condition is that the letters have to be in the correct order. For instance:


LORD can be acronymised from Hello World: heLlO woRlD
LEOD cannot be acronymised from Hello World, as no ls are before e


Your task is to take two strings as input as to determine if one can be acronymised into the other.

The first input, the phrase, will only contain letters (A-Z or a-z) and spaces, and the second input, the acronym, will only contain letters (A-Z or a-z). The acronym will always be shorter, or of equal size, to the phrase, and both the acronym and the phrase will be, at minimum, 1 letter long. You may choose which case (upper or lower) you want the inputs to be.

You may choose any two values to represent true and false, as long as those values are consistent.

This is code-golf so the shortest code in bytes wins

Examples

HELLO WORLD, LORD -&gt; true
CODE GOLF AND CODING CHALLENGES, DANGLE -&gt; true
SANDBOX FOR PROPOSED CHALLENGES, CODE -&gt; false
HELLO WORLD, LLLD -&gt; true
HELLO WORLD, LLDL -&gt; false
NEW YORK POLICE DEPARTMENT, NOODLE -&gt; false
MASSACHUSETTS INSTITUTE OF TECHNOLOGY, MUTTON -&gt; true
BOB, BOB -&gt; true
PRESIDENT OF THE UNITED STATES, I -&gt; true
Brachylog, 1 byte

⊇


Try it online!